Hilbert's Nullstellensatz is in the polynomial hierarchy

Journal of Complexity

Volumn 12, Issue 4, 1996, Pages 273-286

  Koiran, Pascal ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (17)

1. ADLEMAN, L. M., AND ODLYZKO, A. M. (1983), Irreducibility testing and factorization of polynomials. Math. Comput. 41, 699-709.
2. BALCÁZAR, J. L., DIÁZ, J., AND GABARRÓ, J. (1988), "Structural Complexity, I," EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin/New York.
3. BLUM, L., SHUB, M., AND SMALE, S. (1989), On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. 21(1), 1-46.
4. CANNY, J. (1988), Some algebraic and geometric computations in ESPACE, in "Proc. 20th ACM Symposium on Theory of Computing," pp. 460-467.
5. FICHTAS, N., GALLIGO, A., AND MORGENSTERN, J. (1990), Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields, J. Pure Appl. Algebra 67, 1-14.
6. GIUSTI, M., AND HEINTZ, J. (1993), La détermination des points isolés et la dimension d'une variété algébrique peut se faire en temps polynomial, in "Computational Algebraic Geometry and Commutative Algebra (Cortona, 1991)," pp. 216-256. Sympos. Math., Vol. XXXIV, Cambridge, Cambridge Univ. Press.
7. HEINTZ, J., AND MORGENSTERN, J. (1993), On the intrinsic complexity of elimination theory, J. Complexity 9, 471-498; preprint: Technical Report 93-17, Laboratoire I3S, Université de Nice - Sophia Antipolis.
8. KOLLÁR, J. (1988), Sharp effective Nullstellensatz, J. Amer. Math. Soc. 1, 963-975.
9. KRICK, T. AND PARDO, L. M. (1994), Une approche informatique pour l'approximation diophantienne (A computational approach to diophantine approximation), C.R. Acad. Sci. Paris Sér. I Math. 318(5), 407-412.
10. LAGARIAS, J. C, AND ODLYZKO, A. M. (1977), Effective versions of the Chebotarev density theorem, in "Algebraic Number Fields" (A. Frölich, Ed.), pp. 409-464, Academic Press, New York, 1977.
11. Loos, R. (1982), Computing in algebraic extensions, in "Computer Algebra, Symbolic and Algebraic Computation" (Buchberger, Collins, and Loos, Ed.), pp. 173-187, Springer-Verlag, Berlin/New York.
12. MIGNOTTE, M. (1982), Some useful bounds, in "Computer Algebra - Symbolic and Algebraic Computation" (Buchberger, Collins, Loos, and Albrecht, Eds.), pp. 259-263, Springer-Verlag, Berlin/New York.
13. PRATT, V. (1975), Every prime has a succinct certificate, SIAM J. Comput. 4(3), 214-220.
14. SHUB, M., AND SMALE, S. (1996), On the intractability of Hilbert's Nullstellensatz and an algebraic version of "P = NP," Duke J. Math. 81(1), 47-54.
15. SIPSER, M. (1983), A complexity theoretic approach to randomness in "Proc. 15th ACM Symposium on Theory of Computing," pp. 330-335.
16. STOCKMEYER, L. (1985), On approximation algorithms for #P,SIAM J. Comput. 14(4), 849-861.
17. WEINBERGER, P. J. (1984), Finding the number of factors of a polynomial, J. Algorithms 5, 180-186.