The Complexity of Local Dimensions for Constructible Sets

Journal of Complexity

Volumn 16, Issue 1, 2000, Pages 311-323

  Koiran, Pascal ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (19)

1. Babai L., Moran S. Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes. J. Comput. System Sci. 36:1988;254-276.
2. Blum L., Cucker F., Shub M., Smale S. Complexity and Real Computation. 1998;Springer-Verlag, New York/Berlin.
3. 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.
4. Boppana R., Håstad J., Zachos S. Does co-NP have short interactive proofs? Inform. Process. Lett. 25:1987;127-132.
5. Chapuis O., Koiran P. Technical Report. 1997.
6. Chistov A. Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time. J. Sov. Math. 34:1986;1838-1882.
7. Chistov A. Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic. J. Pure Appl. Algebra. 117/118:1997;145-175.
8. 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.
9. 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 (Cortona, 1991). Sympos. Math. 34:1993;Cambridge Univ. Press, Cambridge. p. 216-256.
10. Hartshorne R. Algebraic Geometry. Graduate Texts in Mathematics. 1977;Springer-Verlag, New York/Berlin.
11. Heintz J. Definability and fast quantifier elimination over algebraically closed fields. Theor. Comput. Sci. 24:1983;239-277.
12. P. Koiran, Approximating the volume of definable sets, in Proc. 36th IEEE Symposium on Foundations of Computer Science, 1995, pp. 134-141.
13. Koiran P. Hilbert's Nullstellensatz is in the polynomial hierarchy. J. Complexity. 12:1996;273-286.
14. 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.
15. Koiran P. Elimination of parameters in the polynomial hierarchy. Theor. Comput. Sci. 215:1999;284-304.
16. Koiran P. LIP Research Report. 1999.
17. Kollár J. Sharp effective Nullstellensatz. Amer. Math. Soc. 1:1988;963-975.
18. Poizat B. Les Petits Cailloux. Nur Al-Mantiq Wal-Ma'rifah. 3:1995;Aléas, Lyon.
19. Sommese A. J., Wampler C. W. Numerical algebraic geometry. Renegar J., Shub M., Smale S. The Mathematics of Numerical Analysis, Park City, Utah, 1995. Amer. Math. Soc. 1996;749-763 Providence.