next up previous
Next: About this document ... Up: An Introduction to Quantifier Previous: Solution formula construction

Bibliography

natexlab url

Brown(1999)
C. W. Brown.
Guaranteed solution formula construction.
In Proc. International Symposium on Symbolic and Algebraic Computation, pages 137-144, 1999.

Brown(2001)
C. W. Brown.
Improved projection for cylindrical algebraic decomposition.
Accepted for publication in the Journal of Symbolic Computation, April 2001.

Brown(99)
C. W. Brown.
Solution Formula Construction for Truth Invariant CAD's.
PhD thesis, University of Delaware, 99.

Caviness and Johnson(1998)
B.F. Caviness and J. R. Johnson, editors.
Quantifier Elimination and Cylindrical Algebraic Decomposition.
Texts and Monographs in Symbolic Computation. Springer-Verlag, 1998.

Cohen(1969)
P. J. Cohen.
Decision procedures for real and $p$-adic fields.
Comm. Pure and Applied Math., 22(2):-151, March 1969.

Collins(1975)
G. E. Collins.
Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition.
In Lecture Notes In Computer Science, volume Vol. 33, pages 134-183. Springer-Verlag, Berlin, 1975.
Reprinted in [Caviness and Johnson(1998)].

Davenport and Heintz(1997)
J. H. Davenport and J. Heintz.
Real quantifier elimination is doubly exponential.
Journal of Symbolic Computation, 5:-35, 1997.

Fischer and Rabin(1974)
M. J. Fischer and M. O. Rabin.
Super-exponential complexity of Pressburger arithmetic.
Complexity of Computation (AMS-SIAM Proceedings), 7:-41, 1974.

Grigor'ev(1988)
D. Yu. Grigor'ev.
The complexity of deciding tarski algebra.
Journal of Symbolic Computation, 5:-108, 1988.

Heintz et al.(1990)Heintz, Roy, and Solernó
J. Heintz, M. Roy, and P. Solernó.
Sur la complexité du principe de Tarski-Seidenberg.
Bull. Soc. Math. France, 118:-126, 1990.

Hong(1990)
H. Hong.
An improvement of the projection operator in cylindrical algebraic decomposition.
In Proc. International Symposium on Symbolic and Algebraic Computation, pages 261-264, 1990.

Hong(1992)
H. Hong.
Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination.
In Proc. International Symposium on Symbolic and Algebraic Computation, pages 177-188, 1992.

Hong(1993)
H. Hong.
Quantifier elimination for formulas constrained by quadratic equations via slope resultants.
Computer J., 36(5):-449, 1993.

Hong et al.(1997)Hong, Liska, and Steinberg
H. Hong, R. Liska, and S. Steinberg.
Testing stability by quantifier elimination.
Journal of Symbolic Computation, 24(2):-187, Aug. 1997.
Special Issue on Applications of Quantifier Elimination.

McCallum(1998)
S. McCallum.
An improved projection operator for cylindrical algebraic decomposition.
In B. Caviness and J. Johnson, editors, Quantifier Elimination and Cylindrical Algebraic Decomposition, Texts and Monographs in Symbolic Computation. Springer-Verlag, Vienna, 1998.

Mishra(1993)
B. Mishra.
Algorithmic Algebra.
Springer-Verlag New York, Inc., 1993.

Pedersen et al.(1993)Pedersen, Roy, and Szpirglas
P. Pedersen, M. Roy, and A. Szpirglas.
Counting real zeros in the multivariate case.
In F. Esyette and A. Galligo, editors, Proc. MEGA'92. Birkhäuser Boston, 1993.

Renegar(1992)
J. Renegar.
On the computational complexity and geometry of the first-order theory of the reals, parts I-III.
Journal of Symbolic Computation, 13:-352, 1992.

Schwartz and Sharir(1981)
J. Schwartz and M. Sharir.
On the `piano movers' problem. i. the case of a two-dimensional rigid polygonal body moving amidst polygonal barriers.
Technical Report 39, Department of Computer Science, Courant Institute of Mathematical Sciences, 1981.

Seidenberg(1954)
A. Seidenberg.
A new decision method for elementary algebra.
Annals of Math., 60(2):-374, 1954.

Strzebonski(2000)
A. Strzebonski.
Solving systems of strict polynomial inequalities.
Journal of Symbolic Computation, 29:-480, 2000.

Tarski(1951)
A. Tarski.
A Decision Method for Elementary Algebra and Geometry.
University of California Press, Berkeley, 1951.
second ed., rev. Reprinted in [Caviness and Johnson(1998)].

Weispfenning(1988)
V. Weispfenning.
The complexity of linear problems in fields.
Journal of Symbolic Computation, 5:-27, 1988.

Weispfenning(1994)
V. Weispfenning.
Quantifier elimination for real algebra -- the cubic case.
In Proc. International Symposium on Symbolic and Algebraic Computation, pages 258-263, 1994.

Weispfenning(1997)
V. Weispfenning.
Quantifier elimination for real algebra -- the quadratic case and beyond.
AAECC, 8:-101, 1997.

Weispfenning(1998)
V. Weispfenning.
A new approach to quantifier elimination for real algebra.
In B. Caviness and J. Johnson, editors, Quantifier Elimination and Cylindrical Algebraic Decomposition, Texts and Monographs in Symbolic Computation. Springer-Verlag, Vienna, 1998.



Christopher W Brown
2001-07-10