On the combinatorial and algebraic complexity of quantifier elimination

Journal of the ACM

Volumn 43, Issue 6, 1996, Pages 1002-1045

  Basu, Saugata ^a,c   Pollack, Richard ^a,c   Roy, Marie Françoise ^b  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITÉ DE RENNES 1   (France)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

Algorithms; Quantifier elimination; Real closed fields; Tarski Seidenberg principle; Theory

Indexed keywords

ALGEBRA; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; FORMAL LOGIC; POLYNOMIALS;

ALGEBRAIC COMPLEXITY; COMBINATORIAL COMPLEXITY; QUANTIFIER ELIMINATION; REAL CLOSED FIELDS; TARSKI-SEIDENBERG PRINCIPLE;

ALGORITHMS;

EID: 0030291482     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/235809.235813     Document Type: Article

References (38)

1. ALONSO, M. E., BECKER, E., ROY, M.-F., AND WORMANN, T. 1996. Zero's, multiplicities, and idempotents for zero dimensional systems. In Algorithms in Algebraic Geometry and Applications. L. Gonzalez-Vega and T. Recio, eds. Birkhauser, pp. 6-16.
2. ATIYAH, M. F., AND MACONALD, I. G. 1969. Introduction to Commutative Algebra. Addison-Wesley, Reading, Pa.
3. BASU, S., POLLACK, R., AND ROY, M.-F. A new algorithm to find a point in every cell defined by a family of polynomials. In Quantifier Elimination and Cylindrical Algebraic Decomposition. B. Caviness and J. Johnson, eds. Springer-Verlag, New York, to appear.
4. BASU, S., POLLACK, R., AND ROY, M.-F. 1995. Computing a set of points meeting every cell defined by a family of polynomials on a variety. In Algorithmic Foundations of Robotics. K. Y. Goldberg, D. Halperin, J.-C. Latombe, R. H. Wilson, eds. A. K. Peters, Boston, Mass., pp. 537-555.
5. BASU, S., POLLACK, R., AND ROY, M. F. 1996. On the number of cells defined by a family of polynomials on a variety. Mathematika 43, 120-126.
6. BASU, S., POLLACK, R., AND ROY, M. F. 1994. On the combinatorial and algebraic complexity of quantifier elimination. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 632-641.
7. BEN-OR, M., KOZEN, D., AND REIF, J. 1986. The complexity of elementary algebra and geometry. J. Comput. Syst. Sci. 18, 251-264.
8. BERKOWITZ, S. J. 1984. On computing the determinant in small parallel time using a small number of processors. Inform. Process. Lett. 32, 147-150.
9. BOCHNAK, J., COSTE, M., AND ROY, M. F. 1987. Géométrie algébrique réelle. Springer-Verlag, New York.
10. BUCHBERGER, B. 1985. Gröbner bases: An algorithmic method in polynomial ideal theory. In Recent Trends in Multidimensional Systems Theory. Reider, ed. Bose.
11. CANNY, J. 1988. Some algebraic and geometric computations in PSPACE. In Proceedings of the 20th ACM Symposium on Theory of Computing. (Chicago, Ill., May 2-4). ACM, New York, pp. 460-467.
12. CANNY, J. 1993a. Some practical tools for algebraic geometry. Tech. rep. Spring school on robot motion planning at Rodez, France. PROMOTION ESPRIT, pp. 39-52.
13. CANNY, J. 1991. An improved sign determination algorithm. AAECC, New Orleans.
14. CANNY, J. 1993b. Improved algorithms for sign determination and existential quantifier elimination. Comput. J. 36, 409-418.
15. COLLINS, G. E. 1975. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Springer Lecture Notes in Computer Science 33, 515-532.
16. COSTE, M., AND ROY, M. F. 1988. Thom's lemma, the coding of real algebraic numbers and the topology of semi-algebraic sets. J. Symb. Comput. 5, 121-129.
17. GIUSTI, M., AND HEINTZ, J. 1991. La détermination des points isolés d'une variété algébrique peut se faire en temps polynomial. In Proceedings of the International Meeting on Commutative Algebra. Cortona.
18. GRIGOR'EV, D. 1988. The Complexity of deciding Tarski algebra. J. Symb. Comput. 5, 65-108.
19. GRIOOR'EV, D., AND VOROBJOV, N. 1988. Solving systems of polynomial inequalities in subexponential time. J. Symb. Comput. 5, 37-64.
20. GRIGOR'EV, D., AND VOROBJOV, N. 1992. Counting connected components of a semi-algebraic set in subexponential time. Comput. Complexity 2, 133-186.
21. HEINTZ, J., ROY, M.-F., AND SOLERNO, P. 1990. Sur la complexité du principe de Tarski-Seidenberg. Bull. Soc. Math. France 118, 101-126.
22. HEINTZ, J., ROY, M.-F., AND SOLERNÓ, P. 1989. On the Complexity of Semi-Algebraic Sets. In Proceedings of IFIP '89 (San Francisco, Calif.). North-Holland, Amsterdam, The Netherlands, pp. 293-298.
23. KOIRAN, P. 1993. A weak version of the Blum, Shub & Smale model. In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 486-495.
24. KRICK, T., AND PARDO, L. M. 1996. A computational method for diophantine approximation. In Algorithms in Algebraic Geometry and Applications, L. Gonzalez-Vega and T. Recio, eds. Birkhauser, pp. 193-253.
25. MIGNOTTE, M., 1992. Some useful bounds. In Mathematics for Computer Algebra. Springer-Verlag, New York.
26. MISHRA, B. 1994. Algorithmic Algebra. Springer-Verlag, New York.
27. POLLACK, R., AND ROY, M.-F. 1993. On the number of cells defined by a set of polynomials. C. R. Acad. Sci. Paris 316, 573-577.
28. PEDERSEN, P., ROY, M.-F., AND SZPIRGLAS, A. 1993. Counting real zeros in the multivariate case. In Computational algebraic geometry, Eyssette et Galligo, eds. Progress in Mathematics, vol. 109. Birkhauser, pp. 203-224.
29. RENEGAR, J. 1991. Recent progress on the complexity of the decision problem for the reals. In Discrete and Computational Geometry: Papers from the DIMACS Special Year. DIMACS series in Discrete Mathematics and Theoretical Computer Science, vol. 6. AMS-ACM, New York, pp. 287-308.
30. RENEGAR, J. 1992. On the computational complexity and geometry of the first order theory of the reals. J. Symb. Comput. 13, 3, 255-352.
31. ROY, M.-F. Basic algorithms in real algebraic geometry: From Sturm theorem to the existential theory of reals. Lectures on real geometry in memoriam of Mario Raimondo. In de Gruyter Expositions in Mathematics, to appear.
32. ROY, M.-F., AND SZPIRGLAS, A. 1990. Complexity of computations with real algebraic numbers. J. Symb. Comput. 10, 39-51.
33. ROY, M.-F., AND VOROBJOV, N. 1994. Finding irreducible components of some real transcendental varieties. Comput. Complexity 4, 107-132.
34. SEIDENBERG, A. 1954. A new decision method for elementary algebra. Ann. Math. 60, 365-374.
35. TARSKI, A. 1951. A decision method for elementary algebra and geometry. University of California Press.
36. VAN DER WAERDEN, B. L. 1950. Modern Algebra, Volume II. F. Ungar Publishing Co.
37. VOROBJOV, N. 1984. Bounds of real roots of a system of algebraic equations. In Notes of Science Seminars of Leningrad Department of Math, Vol. 137. (St. Petersburg, Fla.). Steklov Institute, 7-19.
38. WALKER, R. J. 1950. Algebraic curves. Princeton University Press, Princeton, NJ.