An improved sign determination algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 539 LNCS, Issue , 1991, Pages 108-117

  Canny, J F ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NUMERICAL METHODS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; SURFACE MEASUREMENT;

ARITHMETIC OPERATIONS; CONNECTED COMPONENT; DETERMINATION ALGORITHM; DETERMINATION METHODS; NUMERICAL APPROACHES; QUANTIFIER ELIMINATION; SEMI-ALGEBRAIC SETS; TRANSCENDENTAL FUNCTIONS;

ALGEBRA;

EID: 0347547258     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54522-0_100     Document Type: Conference Paper

References (13)

1. M. Ben-Or, D. Kozen, and J. Reif. The complexity of elementary algebra and geometry. J. Comp. and Sys. Sci., 32:251–264, 1986.
2. J. Canny. Some algebraic and geometric computations in PSPACE. In ACM Symposium on Theory of Computing, pages 460–467, 1988.
3. J. Canny. Computing roadmaps of general semi-algebraic sets. In AAECC-91 (this volume), 1991.
4. J.F. Canny, D.Y. Grigor'ev, and N.N. Vorobjov. Finding connected components of a semialgebraic set in subexponential time. App. Algebra in Eng. Comm. and Comp. (submitted), 1991.
5. G. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Springer LNCS, 33:135–183, 1975.
6. D.Y. Grigor'ev. Complexity of deciding Tarski algebra. Journal of Symbolic Computation, 5:65–108, 1988.
7. D.Y. Grigor'ev and N.N. Vorobjov. Solving systems of polynomial equations in subexponential time. Journal of Symbolic Computation, 5:37–64, 1988.
8. J. Heintz, M.F. Roy, and P. Solerno.: Complexité du principe de Tarski-Seidenberg. Bull. Soc. Math. France, 118:101–126, 1990.
9. C.A. Neff. Specified precision polynomial root isolation is in C. In IEEE Conference on Foundations of Computer Science, 1990.
10. J. Renegar. On the computational complexity and geometry of the first-order theory of the reals, parts I, II and III. Technical Report 852,855,856, Cornell University, Operations Research Dept., 1989.
11. M.F. Roy and A. Szpirglas. Complexity of computation on real algebraic numbers. Journal of Symbolic Computation, 10(1):39–52, 1990.
12. A. Seidenberg. Constructions in algebra. Trans. AMS, 197:273–313, 1974.
13. A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley, 1948.