Effective Semialgebraic Geometry

The first part of the paper introduces the decision problem and the quantifier elimination problem for elementary algebra. Tarski's algorithm, which is based on criteria for the existence of solutions of systems of polynomial equations and inequalities generalizing Sturm's theorem, is presented. Then the text is devoted to the cylindrical algebraic decomposition algorithm of Collins, which relies on the basic methods of the theory of semialgebraic sets initiated by Lojasiewicz. Special attention is paid to the topological aspect of the cylindrical algebraic decomposition, which provides a general method (surely too general to be efficient in practice) for robot motion planning. The techniques and results presented here have no pretention to originality. The references given at the end of the paper are just a sample of the literature on the subject, far from being exhaustive.

[1]  Dennis S. Arnon A Cluster-Based Cylindrical Algebraic Decomposition Algorithm , 1988, J. Symb. Comput..

[2]  D. S. Arnon,et al.  Algorithms in real algebraic geometry , 1988 .

[3]  A. Tarski A Decision Method for Elementary Algebra and Geometry , 2023 .

[4]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[5]  Maurice Mignotte,et al.  On Mechanical Quantifier Elimination for Elementary Algebra and Geometry , 1988, J. Symb. Comput..

[6]  James H. Davenport,et al.  Real Quantifier Elimination is Doubly Exponential , 1988, J. Symb. Comput..

[7]  John H. Reif,et al.  The complexity of elementary algebra and geometry , 1984, STOC '84.

[8]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[9]  George E. Collins,et al.  Cylindrical Algebraic Decomposition II: An Adjacency Algorithm for the Plane , 1984, SIAM J. Comput..

[10]  A. Seidenberg A NEW DECISION METHOD FOR ELEMENTARY ALGEBRA , 1954 .

[11]  George E. Collins,et al.  An Adjacency Algorithm for Cylindrical Algebraic Decompositions of Three-Dimensional Space , 1988, J. Symb. Comput..

[12]  Daniel Lazard,et al.  Quantifier Elimination: Optimal Solution for Two Classical Examples , 1988, J. Symb. Comput..

[13]  D. Grigor'ev Complexity of deciding Tarski algebra , 1988 .

[14]  George E. Collins,et al.  Cylindrical Algebraic Decomposition I: The Basic Algorithm , 1984, SIAM J. Comput..

[15]  J. Davenport A "Piano Movers" Problem. , 1986 .