An improved sign determination algorithm

  • J. F. Canny
Submitted Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 539)


Recently there has been a lot of activity in algorithms that work over real closed fields, and that perform such calculations as quantifier elimination or computing connected components of semi-algebraic sets. A cornerstone of this work is a symbolic sign determination algorithm due to Ben-Or, Kozen and Reif [BOKR86]. In this paper we describe a new sign determination method based on the earlier algorithm, but with two advantages: (i) It is faster in the univariate case, and compares very well with numerical approaches, and (ii) In the general case, it allows purely symbolic quantifier elimination in pseudo-polynomial time. By purely symbolic, we mean that it is possible to eliminate a quantified variable from a system of polynomials no matter what the coefficient values are. The previous methods required the coefficients to be themselves polynomials in other variables and the number of arithmetic operations over the coefficient field increases with the degree of the coefficients. Our new method allows transcendental functions or derivatives to appear in the coefficients, and the number of arithmetic operations is completely independent of the coefficients.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BOKR86]
    M. Ben-Or, D. Kozen, and J. Reif. The complexity of elementary algebra and geometry. J. Comp. and Sys. Sci., 32:251–264, 1986.Google Scholar
  2. [Can88]
    J. Canny. Some algebraic and geometric computations in PSPACE. In ACM Symposium on Theory of Computing, pages 460–467, 1988.Google Scholar
  3. [Can91]
    J. Canny. Computing roadmaps of general semi-algebraic sets. In AAECC-91 (this volume), 1991.Google Scholar
  4. [CGV91]
    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.Google Scholar
  5. [Col75]
    G. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Springer LNCS, 33:135–183, 1975.Google Scholar
  6. [Gri88]
    D.Y. Grigor'ev. Complexity of deciding Tarski algebra. Journal of Symbolic Computation, 5:65–108, 1988.Google Scholar
  7. [GV88]
    D.Y. Grigor'ev and N.N. Vorobjov. Solving systems of polynomial equations in subexponential time. Journal of Symbolic Computation, 5:37–64, 1988.Google Scholar
  8. [HRS90]
    J. Heintz, M.F. Roy, and P. Solerno. Complexité du principe de Tarski-Seidenberg. Bull. Soc. Math. France, 118:101–126, 1990.Google Scholar
  9. [Nef90]
    C.A. Neff. Specified precision polynomial root isolation is in NC. In IEEE Conference on Foundations of Computer Science, 1990.Google Scholar
  10. [Ren89]
    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.Google Scholar
  11. [RS90]
    M.F. Roy and A. Szpirglas. Complexity of computation on real algebraic numbers. Journal of Symbolic Computation, 10(1):39–52, 1990.Google Scholar
  12. [Sei74]
    A. Seidenberg. Constructions in algebra. Trans. AMS, 197:273–313, 1974.Google Scholar
  13. [Tar48]
    A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley, 1948.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • J. F. Canny
    • 1
  1. 1.Computer Science DivisionUniversity of CaliforniaBerkeley

Personalised recommendations