# Cylindrical algebraic decomposition by quantifier elimination

6. Algorithms III

First Online:

## Abstract

Cylindrical algebraic decompositions were introduced as a major component of a new quantifier elimination algorithm for elementary algebra and geometry (G. Collins, 1973). In the present paper we turn the tables and show that one can use quantifier elimination for elementary algebra and geometry to obtain a new version of the cylindrical algebraic decomposition algorithm. A key part of our result is a theorem, of interest in its own right. that relates the multiplicities of the roots of a polynomial to their continuity.

## Keywords

Real Root Computer Science Department Elementary Algebra Quantifier Elimination Real Closed Field
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## References

- [ARN81]Arnon DS: Algorithms for the geometry of semi-algebraic sets, Ph.D. Dissertation, Technical Report #436, Computer Science Department, University of Wisconsin Madison, 1981.Google Scholar
- [BRT71]Brown WS, Traub JF: On Euclid's algorithm and the theory of subresultants,
*J. Assoc. Comp. Mach., 18*, 4 (1971), pp 505–514.Google Scholar - [COL75]Collins GE: Quantifier elimination for real closed fields by cylindrical algebraic decomposition, in
*Second Gl Conference on Automata Theory and Formal Languages*, vol. 33 of Lecture Notes in Computer Science, Springer-Verlag, Berlin. 1975, pp 134–183.Google Scholar - [COL76]Collins GE: Quantifier elimination for real closed fields by cylindrical algebraic decomposition — a synopsis,
*SIGSAM Bulletin of the ACM 10*, 1 (1976), pp 10–12.Google Scholar - [MAR66]Marden M:
*Geometry of polynomials*, (second edn.). American Mathematical Society, Providence, 1966.Google Scholar - [TAR48]Tarski A:
*A decision method for elementary algebra and geometry*, University of California Press, 1948; second edn., rev. 1951.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1982