Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation

Journal of Complexity

Volumn 16, Issue 4, 2000, Pages 716-750

  Rouillier, F ^a   Roy, M F ^a   Safey El Din, M ^a  

^a UNIVERSITÉ DE RENNES 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000076609     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.2000.0563     Document Type: Article

References (34)

1. Alonso M. E., Becker E., Roy M.-F., Wormann T. Zeroes, multiplicities and idempotents for zero dimensional systems. Vega G., Recio T. Algorithms in Algebraic Geometry and Applications. 1996;6-16 Birkhauser, Basel.
2. Basu S., Pollack R., Roy M.-F. A new algorithm to find a point in every cell defined by a family of polynomials. Caviness B., Johnson J. Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic Computation. 1998;341-349 Springer-Verlag, Vienna/New York.
3. Basu S., Pollack R., Roy M.-F. On the combinatorial and algebraic complexity of Quantifier elimination. J. Assoc. Comput. Mach. 43:1996;1002-1045.
4. E. Becker, and, V. Powers, Deciding positivity of real polynomials, Contemp. Math, in press.
5. Bochnak J., Coste M., Roy M.-F. Real Algebraic Geometry. 1999;Springer-Verlag, Berlin/New York.
6. Canny J. Some algebraic and geometric computations in PSPACE. Proc. Twentieth ACM Symp. on Theory of Computing. 1988;. p. 460-467.
7. J. Canny, A toolkit for nonlinear algebra, in, Algorithmic Foundations of Robotics, Proceedings of the Workshop on the Algorithmic Foundations of Robotics, WAFR '94, San Francisco, CA, February 17-19, 1994, (, Goldberg and Ken, et al., Eds.), A. K. Peters, Wellesley, MA.
8. Collins G. E. Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition. Lecture Notes in Computer Science. 33:1975;Springer-Verlag, Berlin/New York. p. 515-532.
9. P. Conti, and, C. Traverso, Algorithms for the real radical, unpublished manuscript.
10. Cox D., Little J., O'Shea D. Ideals, Varieties, and Algorithms. 1991;Springer-Verlag, Berlin/New York.
11. J. C. Faugère, http://www-calfor.lip6.fr/jcf .
12. J. C. Faugère, A new efficient algorithm for computing Gröbner bases, J. Pure Appl. Algebra, in press.
13. Gianni P. Properties of Gröbner Basis under Specializations. Lecture Notes in Computer Science. 378:1987;. p. 293-297.
14. Gonzalez-Vega L., Rouillier F., Roy M.-F., Trujillo G. Symbolic recipes for real solutions. Cohen A. Sometapas of Computer Algebra. 1999;121-167 Springer-Verlag, Berlin/New York.
15. Grigor'ev D., Vorobjov N. Solving systems of polynomial inequalities in subexponential time. J. Symbolic Comput. 5:1988;37-64.
16. Heintz J., Roy M.-F., Solernó P. On the complexity of semi-algebraic sets. Proc. IFIP 89, San Francisco. 1989;North-Holland, Amsterdam. p. 293-298.
17. Heintz J., Roy M.-F., Solerno P. On the theoretical and practical complexity of the existential theory of the reals. Comput. J. 36:1993;427-431.
18. Z. Ligatsikas, R. Rioboo, and M. F. Roy, Generic computation of the real closure of an ordered field, in Proceedings of IMACS 93, Lille, May 1993, pp. 203-208.
19. Mc Callum S. An Improved Projection Operator for Cylindrical Algebraic Decomposition. 1984;University of Wisconsin-Madison.
20. Mumford D. Algebraic Geometry I, Complex Projective Varieties. 1976;Springer-Verlag, Berlin/Heidelberg/New York.
21. Renegar J. On the computational complexity and geometry of the first order theory of the reals. J. Symbolic Comput. 13:1992;255-352.
22. Rioboo R. Quelques aspects du calcul exact avec les nombres réels. 1992;University of Paris 6.
23. R. Rioboo, Algebraic closure of an ordered field, implementation in axiom, in, Proc. of Issac'92, Berkeley, July 1992.
24. Rouillier F. Algorithmes efficaces pour l'étude des zéros réels des systèmes polynomiaux. 1996;University of Rennes I.
25. Rouillier F. Solving zero-dimensional systems through the rational univariate representation. AAECC J. 9:1999;433-461.
26. Rouillier F., Roy M.-F., Safey El Din M. Testing emptiness of real hypersurfaces, real algebraic sets and semi-algebraic sets. FRISCO Rep. Month. 23:1998.
27. F. Rouillier, and, P. Zimmermann, Uspensky's algorithm: improvements and applications, in preparation, 1999.
28. 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. Expositions in Mathematics. 23:1996;de Gruyter, Berlin/New York. p. 1-67.
29. Seidenberg A. A new decision method for elementary algebra. Ann. of Math. 60:1954;365-374.
30. Tarski A. A Decision Method for Elementary Algebra and Geometry. 1951;University of California Press, Berkeley.
31. Walker R. J. Algebraic Curves. 1950;Princeton University Press, Princeton.
32. Weispfenning V. Solving parametric polynomial equations and inequalities by symbolic algorithms. Computer Algebra in Science and Engineering. 1995;World Scientific, Singapore. p. 163-179.
33. Weispfenning V. Quantifier elimination for real algebra - the quadratic case and beyond. J. AAECC. 8:1997;85-101.
34. Weispfenning V. A new approach to quantifier elimination for real algebra. Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic Computation. 1998;Springer-Verlag, Berlin/New York. p. 376-392.