Polynomial-time computing over quadratic maps i: Sampling in real algebraic sets

Computational Complexity

Volumn 14, Issue 1, 2005, Pages 20-52

  Grigoriev, Dima ^a   Pasechnik, Dmitrii V ^b  

^a UNIVERSITÉ DE RENNES 1   (France)

^b TILBURG UNIVERSITY   (Netherlands)

Author keywords

Complexity; Infinitesimal deformation; Quadratic map; Semialgebraic set; Symbolic computation; Univariate representation

Indexed keywords

EID: 18244383505     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-005-0189-7     Document Type: Article

References (17)

1. M.-E. ALONSO, E. BECKER, M.-F. ROY & T. WÖRMANN (1996). Zeros, multiplicities, and idempotents for zero-dimensional systems. In Algorithms in Algebraic Geometry and Applications (Santander, 1994), Progr. Math. 143, Birkhäuser, Basel, 1-15.
2. A. I. BARVINOK (1993). Feasibility testing for systems of real quadratic equations. Discrete Comput. Geom. 10, 1-13.
3. A. I. BARVINOK (1997). On the Betti numbers of semialgebraic sets defined by few quadratic inequalities. Math. Z. 225, 231-244.
4. S. BASU, R. POLLACK & M.-F. ROY (1996). On the combinatorial and algebraic complexity of quantifier elimination. J. ACM 43, 1002-1045.
5. S. BASU, R. POLLACK & M.-F. ROY (2003). Algorithms in Real Algebraic Geometry. Springer.
6. J. BOCHNAK, M. COSTE & M.-F. ROY (1998). Real Algebraic Geometry. Springer, Berlin.
7. D. EISENBUD (1995). Commutative Algebra with a View Toward Algebraic Geometry. Springer, New York.
8. J. VON ZUR GATHEN & J. GERHARD (2003). Modern Computer Algebra. Cambridge Univ. Press, Cambridge.
9. D. GRIGORIEV (1988). Complexity of deciding Tarski algebra. J. Symbolic Comput. 5, 65-108.
10. D. GRIGORIEV & N. N. VOROBJOV (1996). Complexity lower bounds for computation trees with elementary transcendental function gates. Theoret. Comput. Sci. 157, 185-214.
11. D. GRIGORIEV & N. N. VOROBJOV, JR. (1988). Solving systems of polynomial inequalities in subexponential time. J. Symbolic Comput. 5, 37-64.
12. L. E. HEINDEL (1971). Integer arithmetic algorithms for polynomial real zero determination. J. ACM 18, 533-548.
13. U. J. J. LE VERRIER (1840). Sur les variations séculaires des éléments elliptiques des sept planètes principales : Mercure, Vénus, la Terre, Mars, Jupiter, Saturne et Uranus. J. Math. Pures Appl. 5, 220-254.
14. I. G. MACDONALD (1995). Symmetric Functions and Hall Polynomials. Oxford Math. Monographs, Clarendon Press.
15. E. W. MAYR & A. R. MEYER (1982). The complexity of the word problems for commutative semigroups and polynomial ideals. Adv. Math. 46, 305-329.
16. J. RENEGAR (1992). On the computational complexity and geometry of the firstorder theory of the reals. I-III. J. Symbolic Comput. 13, 255-352.
17. F. ROUILLIER, M.-F. ROY & M. SAFEY EL DIN (2000). Finding at least one point in each connected component of a real algebraic set defined by a single equation. J. Complexity 16, 716-750.