Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination

Since Tarski (1951) gave the first quantifier elimination algorithm for real closed fields, various improvements and new methods have been devised and analyzed (Arnon 1981, 1988b; Ben-Or et al. 1986; Boge 1980; Buchberger and Hong 1991; Canny 1988; Cohen 1969; Collins 1975; Collins and Hong 1991; Fitchas et al. 1990a; Grigor’ev 1988; Grigor’ev and Vorobjov 1988; Heintz et al. 1989a; Holthusen 1974; Hong 1989, 1990a, 1990b, 1991a, 1991b, 1991c; Johnson 1991; Langemyr 1990; Lazard 1990; McCallum 1984; Renegar 1992a, 1992b, 1992c; Seidenberg 1954).

[1]  Hoon Pyo Hong.  Comparison of Several Decision Algorithms for the Existential Theory of the Reals , 1991 .

[2]  D. Lazard.  An Improved Projection for Cylindrical Algebraic Decomposition , 1994 .

[3]  R. Rudell,et al.  Multiple-Valued Logic Minimization for PLA Synthesis , 1986 .

[4]  H. Hong.  An improvement of the projection operator in cylindrical algebraic decomposition , 1990, ISSAC '90.

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

[6]  Lars Langemyr.  Algorithms for a Multiple Algebraic Extension II , 1991 .

[7]  Scott F. Smith,et al.  Towards mechanical solution of the Kahan Ellipse Problem 1 , 1983, EUROCAL.

[8]  Radakovič.  The theory of approximation , 1932 .

[9]  J. Cooper,et al.  Theory of Approximation , 1960, Mathematical Gazette.

[10]  Markus Lauer.  A solution to Kahan's problem (SIGSAM problem no. 9) , 1977, SIGS.

[11]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[12]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[13]  Hoon Hong,et al.  Improvements in cad-based quantifier elimination , 1990 .

[14]  Dennis Soule Arnon.  Algorithms for the geometry of semi-algebraic sets , 1981 .

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

[16]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

[17]  Daniel L. Ostapko,et al.  MINI: A Heuristic Approach for Logic Minimization , 1974, IBM J. Res. Dev..

[18]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[19]  Hoon Hong.  Parallelization of Quantifier Elimination on a Workstation Network , 1993, AAECC.

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

[21]  Scott McCallum.  An improved projection operation for cylindrical algebraic decomposition (computer algebra, geometry, algorithms) , 1984 .

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

[23]  J. Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .

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

[25]  George E. Collins,et al.  Partial Cylindrical Algebraic Decomposition for Quantifier Elimination , 1991, J. Symb. Comput..

[26]  Dima Grigoriev,et al.  Solving Systems of Polynomial Inequalities in Subexponential Time , 1988, J. Symb. Comput..

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

[28]  Charles N. Delzell.  A continuous, constructive solution to Hilbert's 17th problem , 1984 .

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

[30]  Joos Heintz,et al.  On the Complexity of Semialgebraic Sets , 1989, IFIP Congress.

[31]  W. Quine.  On Cores and Prime Implicants of Truth Functions , 1959 .

[32]  S. Rudeanu.  Review: W. V. Quine, On Cores and Prime Implicants of Truth Functions , 1970 .

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

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

[35]  William Kahan.  Problem #9: an ellipse problem , 1975, SIGS.

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

[37]  George E. Collins,et al.  Quantifier elimination and the sign variation method for real root isolation , 1989, ISSAC '89.

[38]  Jeremy Johnson,et al.  Algorithms for polynomial real root isolation , 1992 .

[39]  Rüdiger G. K. Loos,et al.  The algorithm description language ALDES (report) , 1976, SIGS.

[40]  Robert K. Brayton,et al.  Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.