The Real Dimension Problem Is NPR-Complete

Journal of Complexity

Volumn 15, Issue 2, 1999, Pages 227-238

  Koiran, Pascal ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (19)

1. Basu S., Pollack R., Roy M.-F. On the combinatorial and algebraic complexity of quantifier elimination. J. Assoc. Comput. Mach. 43:1996;1002-1045.
2. Benedetti R., Risler J.-J. Real Algebraic and Semi-algebraic Sets. 1990;Hermann, Paris.
3. Blum L., Cucker F., Shub M., Smale S. Complexity and Real Computation. 1998;Springer-Verlag, New York/Berlin.
4. Blum L., Shub M., Smale S. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Amer. Math. Soc. 21:1989;1-46.
5. Bochnak J., Coste M., Roy M.-F. Géométrie Algébrique Réelle. 1987;Springer-Verlag, New York/Berlin.
6. Bourbaki N. Algèbre. 1981;Masson, Paris.
7. O. Chapuis, and, P. Koiran, Saturation and stability in the theory of computation over the reals, Technical Report, 1997/3, Institut Girard Desargues, Université Claude Bernard Lyon I, 1997, Ann. Pure Appl. Logic, to appear.
8. Chistov A. Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic. J. Symbolic Comput. 22:1996;1-25.
9. Cucker F., Roselló F. On the complexity of some problems for the Blum, Shub and Smale model. Proceedings of Latin'92. Lecture Notes in Computer Science. 583:1992;Springer-Verlag, New York/Berlin. p. 117-129.
10. Giusti M., Heintz J. Algorithmes-disons rapides-pour la décomposition d'une variété algébrique en composantes irréductibles et équidimensionnelles. Mora T., Traverso C. Effective Methods in Algebraic Geometry (MEGA'90). Progress in Mathematics. 94:1991;169-194 Birkhäuser, Basel.
11. Giusti M., Heintz J. La détermination des points isolés et la dimension d'une variété algébrique peut se faire en temps polynomial. Computational Algebraic Geometry and Commutative Algebra (Cortono, 1991). Sympos. Math. 34:1993;Cambridge Univ. Press, Cambridge. p. 216-256.
12. Koiran P. Elimination of constants from machines over algebraically closed fields. J. Complexity. 13:1997;65-82.
13. P. Koiran, Randomized and deterministic algorithms for the dimension of algebraic varieties, in Proc. 38th IEEE Symposium on Foundations of Computer Science, 1997, pp. 36-45.
14. Koiran P. LIP Research Report. 1997.
15. G. Matera and J. Torres, The space complexity of elimination theory: Upper bounds, in Foundations of Computational Mathematics (Selected Papers of a Conference Held at IMPA in Rio de Janeiro), 1997 (F. Cucker and M. Shub, Eds.), pp. 267-276.
16. Poizat B. Les Petits Cailloux. Nur Al-Mantiq Wal-Ma'rifah. 3:1995;Aléas, Lyon.
17. Renegar J. On the computational complexity and geometry of the first-order theory of the reals, parts I, II, III. J. Symbolic Comput. 13:1992;255-352.
18. Strassen V. Polynomials with rational coefficients which are hard to compute. SIAM J. Comput. 3:1974;128-149.
19. N. Vorobjov, Computing local dimension of a semialgebraic set, in Proc. 30th ACM Symposium on Theory of Computing, 1998, pp. 483-487.