[1] G. E. Collins, "Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition," Lecture Notes on Computer Science, 33 (1975), pp. 134--183.

[2] G. E. Collins, "Quantifier elimination by cylindrical algebraic decomposition--twenty years of progress," in Quantifier Elimination and Cylindrical Algebraic Decomposition, B. F. Caviness and J. R. Johnson (editors), Springer, New York, 1998, pp. 8--23.

[3] G. E. Collins and H. Hong, "Partial cylindrical algebraic decomposition for quantifier elimination," Journal of Symbolic Computation, 12 (1991), pp. 299--328.

[4] A. Dolzmann and T. Sturm, "Simplification of quantifier-free formulae over ordered fields," Journal of Symbolic Computation, 24 (1997), pp. 209--231.

[5] J. C. Faugere, P. Gianni, D. Lazard, and T. Mora, "Efficient computation of zero-dimensional Groebner bases by change of ordering," Journal of Symbolic Computation, 16 (1993), pp. 329--344.

[6] H. Hong, "An improvement of the projection operator in cylindrical algebraic decomposition," Proceedings of ISSAC (1990), pp. 261--264.

[7] R. Loos and V. Weispfenning, "Applying linear quantifier elimination," The Computer Journal, 36 (5) (1993), pp. 450--461.

[8] S. McCallum, "Solving polynomial strict inequalities using cylindrical algebraic decomposition," The Computer Journal, 36 (5) (1993), pp. 432--438.

[9] S. McCallum, "An improved projection for cylindrical algebraic decomposition of three-dimensional space," Journal of Symbolic Computation, 5 (1988), pp. 141--161.

[10] S. McCallum, "An improved projection for cylindrical algebraic decomposition," in Quantifier Elimination and Cylindrical Algebraic Decomposition, B. F. Caviness and J. R. Johnson (editors), Springer, New York, 1998, pp. 242--268.

[11] A. Strzebonski, "An algorithm for systems of strong polynomial inequalities," The Mathematica Journal, 4 (4) (1994), pp. 74--77.

[12] A. Strzebonski, "A real polynomial decision algorithm using arbitrary-precision floating point arithmetic,"  Reliable Computing, 5 (3) (1999), pp. 337--346.