L. Childs. A Concrete Introduction to Higher Algebra. Springer-Verlag, Berlin, 1979. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Automaton-Theoretic Approach to Safety and Security in.. - Lanotte (2003) (Correct)
....returns a formula in # Par ( m) Corollary 2.4. 3 If # m) then D(x, #) is in # Par ( m) An algorithm to solve the problem of the quantifier elimination of real variables with general formulae in # P ( m) is given in [86] This is a generalization of Sturm s algorithm (see [27]) Sturm s algorithm calculates the number of changes of positivity (and so also the number of roots) of a polynomial in an interval. We call D # (x, the formula resulting by the algorithm defined in [86] # ; with Del IR (x, #) we denote the formula # ## where # ## is the formula D(x, #) if ....
....to a formula ) where # # is simple. It is decidable whether a formula ) where # # is simple, is satisfiable. This derives from the fact that if a n k . a 1 k a 0 is a polynomial, then the roots are in the interval [ M,M ] where M = max( an , a . a ) an (see [27]) # 2.5.1 Discussion Due to the presence of arrays (which are functions from integers to reals) the logic #( # id) is a High Order Mathematical Logic. due to the mentioned undecidability result holding for polynomial formulae on integer variables) However, if one considers only linear ....
Childs, L. N.: A Concrete Introduction to Higher Algebra. Springer, 1979.
A Unified Model for Similarity Searching - Chávez, Navarro.. (Correct)
.... relation if it satisfies the properties of x x for all x 2 X, reflexivity x y if and only if y x, symmetry x y and y z then x z, transitivity It can be shown that every partition (X) induces an equivalence relation and, conversely, every equivalence relation induces a partition [10]. Two elements are related if they belong to the same partition. Every element i of the partition is then called an equivalence class. An equivalence class is often named after one of its representatives (any element of i can be taken as a representative) An alternative definition of an ....
L. Childs. A Concrete Introduction to Higher Algebra. Springer-Verlag, 1995.
Searching in Metric Spaces - Chávez, Navarro, Baeza-Yates, .. (1999) (8 citations) (Correct)
.... equivalence relation if it satisfies, for all x; y; z 2 X, the properties of reflexivity (x x) symmetry (x y , y x) and transitivity (x y y z ) x z) It can be shown that every partition (X) induces an equivalence relation and, conversely, every equivalence relation induces a partition [25]. Two elements are related if they belong to the same partition. Every element i of the partition is then called an equivalence class. An equivalence class is often named after one of its representatives (any element of i can be taken as a representative) An alternative definition of an ....
L. Childs. A Concrete Introduction to Higher Algebra. Springer-Verlag, 1995.
The Automatic Solution of Recurrence Relations I. Linear .. - Bagnara, Zaccagnini.. (Correct)
No context found.
L. Childs. A Concrete Introduction to Higher Algebra. Springer-Verlag, Berlin, 1979.
The Automatic Solution - Of Recurrence Relations (Correct)
No context found.
L. Childs. A Concrete Introduction to Higher Algebra. Springer-Verlag, Berlin, 1979.
Prime-Producing Cubic Polynomials - Mott, ROSE (Correct)
No context found.
L. Childs, A Concrete Introduction to Higher Algebra, Springer-Verlag, New York, 1979.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC