Polar Varieties and Computation of one Point in each Connected Component of a Smooth Real Algebraic Set

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2003, Pages 224-231

  Safey El Din, Mohab ^a   Schost, Éric ^b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b ECOLE POLYTECHNIQUE   (France)

Author keywords

Complexity; Polynomial system solving; Real solutions

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; POLYNOMIALS; SET THEORY;

POLYNOMIAL SYSTEM SOLVING; REAL SOLUTIONS;

ALGEBRA;

EID: 1542300104     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/860854.860901     Document Type: Conference Paper

References (24)

1. M. E. Alonso, E. Becker, M.-F. Roy, and T. Wörmann. Zeroes, multiplicities and idempotents for zerodimensional systems. In Proceedings MEGA '94, volume 142 of Progress in Mathematics, pages 1-15. Birkhäuser, 1996.
2. P. Aubry, F. Rouillier, and M. Safey El Din. Real solving for positive dimensional systems. Journal of Symbolic Computation, 34(6):543-560, 2002.
3. B. Bank, M. Giusti, J. Heintz, and G.-M. Mbakop. Polar varieties and efficient real equation solving: the hypersurface case. Journal of Complexity, 13(1):5-27, 1997.
4. B. Bank, M. Giusti, J. Heintz, and G.-M. Mbakop. Polar varieties and efficient real elimination. Mathematische Zeitschrift, 238(1):115-144, 2001.
5. B. Bank, M. Giusti, J. Heintz, and L.-M. Pardo. The light is polar. Unpublished manuscript, 2003.
6. S. Basu. Algorithms in semi-algebraic geometry. PhD thesis, New-York University, 1996.
7. S. Basu, R. Pollack, and M.-F. Roy. On the combinatorial and algebraic complexity of quantifier elimination. Journal of ACM, 43(6):1002-1045, 1996.
8. S. Basu, R. Pollack, and M.-F. Roy. A new algorithm to find a point in every cell defined by a family of polynomials. In Quantifier elimination and cylindrical algebraic decomposition. Springer-Verlag, 1998.
9. M. Giusti, K. Hägele, J. Heintz, J.-E Morals, J.-L. Montaña, and L.-M. Pardo. Lower bounds for Diophantine approximation. In Proceedings of MEGA'96, number 117, 118 in Journal of Pure and Applied Algebra, pages 277-317, 1997.
10. M. Giusti, J. Heintz, J.-E. Morais, J. Morgenstern, and L.-M. Pardo. Straight-line programs in geometric elimination theory. Journal of Pure and Applied Algebra, 124:101-146, 1998.
11. M. Giusti, J. Heintz, J.-E. Morais, and L.-M. Pardo. When polynomial equation systems can be solved fast? In Proceedings of AAECC-11, volume 948 of LNCS, pages 205-231. Springer, 1995.
12. M. Giusti, G. Lecerf, and B. Salvy. A Gröbner free alternative for polynomial system solving. Journal of Complexity, 17(1):154-211, 2001.
13. D. Grigoriev and N. Vorobjov. Solving systems of polynomials inequalities in subexponential time. Journal of Symbolic Computation, 5:37-64, 1988.
14. J. Heintz, M.-F. Roy, and P. Solernò. On the complexity of semi-algebraic sets. In Proceedings IFIP'89 San Francisco, North-Holland, 1989.
15. J. Heintz, M.-F. Roy, and P. Solernò. On the theoretical and practical complexity of the existential theory of the reals. The Computer Journal, 36(5):427-431, 1993.
16. Z. Jelonek. Testing sets for properness of polynomial mappings. Mathematische Annalen, 315(1):1-35, 1999.
17. G. Jeronimo, T. Krick, J. Sabia, and M. Sombra. The computational complexity of the Chow form. Technical report Institut de mathématiques de Jussieu, 2003.
18. G. Jeronimo, and J. Sabia. Effective equidimensional decomposition of affine varieties. Journal of Pure and Applied Algebra, 169(2-3):229-248, 2002.
19. G. Lecerf. Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. To appear in Journal of Complexity, 2003.
20. F. Rouillier. Solving zero-dimensional systems through the Rational Univariate Representation. AAECC Journal, 9(5):433-461, 1999.
21. F. Rouillier, M.-F. Roy, and M. Safey El Din. Finding at least one point in each connected component of a real algebraic set defined by a single equation. Journal of Complexity, 16:716-750, 2000.
22. M. Safey El Din. Résolution réelle des systèmes polynomiaux de dimension positive. PhD thesis, Université Paris 6, January 2001.
23. M. Safey El Din and É. Schost. Properness defects of projections and computation of one point in each connected component of a real algebraic set. Technical report, RR INRIA, 2002.
24. I. Shafarevich. Basic Algebraic Geometry 1. Springer Verlag, 1977.