On the intrinsic complexity of the arithmetic Nullstellensatz1

Journal of Pure and Applied Algebra

Volumn 146, Issue 2, 2000, Pages 103-183

  Hagele K ^a   Morais, J E ^b   Pardo, L M ^a   Sombra, M ^c  

^a UNIVERSITY OF CANTABRIA   (Spain)

^b PUBLIC UNIVERSITY OF NAVARRE   (Spain)

^c FACULTAD DE CIENCIAS EXACTAS   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034695774     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-4049(98)00148-0     Document Type: Article

References (87)

1. M. Aldaz, J. Heintz, G. Matera, J.L. Montaña, L.M. Pardo, Time-space Tradeoffs in Algebraic Complexity Theory, preprint, Universidad de Cantabria, Santander, Spain, 1996.
2. M. Almeida, L. D'Alfonso, P. Solernó, On the degrees of bases of free modules over a polynomial ring, Math. Z., to appear.
3. M.E. Alonso, E. Becker, M.-F. Roy, T. Wörmann, Zeroes, multiplicities and idempotents for zerodimensional systems, in: Algorithms in Algebraic Geometry and Applications, Proc. MEGA'94, Progress in Mathematics, vol. 142, Birkhäuser, Basel, 1996, pp. 1-15.
4. I. Armendáriz, P. Solernó, On the computation of the radical of polynomial complete intersection ideals, in: G. Cohen, H. Giusti, T. Mora (Eds.), Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Proc. AAECC-11, Lecture Notes in Computer Science, vol. 948, Springer, Berlin, 1995, pp. 106-119.
5. E. Becker, J.P. Cardinal, M.F. Roy, Z. Szafraniec, Multivariate Bezoutians, Kronecker symbol and Eisenbud-Levine formula, in: Algorithms in Algebraic Geometry and Applications, Proc. MEGA'94, Progress in Mathematics, vol. 142, Birkhäuser, Basel, 1996, pp. 79-104.
6. n], Acta. Math. 166 (1991) 69-120.
7. C. Berenstein, A. Yger, Une formule de jacobi et ses conséquences, Ann. Sci. E.N.S. 24(4) (1991) 363-377.
8. S. J. Berkowitz, On computing the determinant in small parallel time using a small number of processors, Inform. Process. Lett. 18 (1984) 147-150.
9. L. Blum, F. Cucker, M. Shub, S. Smale, Complexity and real computation: A manifesto, Technical Report ICSI-TR-95-042, International Computer Science Institute, Berkeley, CA, August 1995.
10. L. Blum, F. Cucker, M. Shub, S. Smale, Complexity and Real Computation, Springer, Berlin, 1998.
11. A. Borodin, J. von zur Gathen, J. Hopcroft, Fast parallel matrix and gcd computations, Proc. 23rd Ann. Symp. FOCS, 1982, pp. 65-71.
12. D.W. Brownawell, Bounds for the degree in the Nullstellensatz, Ann. Math. 126 (1987) 577-591.
13. L. Caniglia, A. Galligo, J. Heintz, Borne simple exponentielle pour les degrés dans le théorème des zéros sur un corps de charactéristique quelconque, C. R. Acad. Sci. Paris 307 (1988) 255-258.
14. L. Caniglia, A. Galligo, J. Heintz, Some new effectivity bounds in computational geometry, in: T. Mora, (Ed.), Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Proc. AAECC-6, Lecture Notes in Computer Science, vol. 357, Springer, Berlin, 1989, pp. 131-152.
15. L. Caniglia, A. Galligo, J. Heintz, Equations for the projective closure and effective Nullstellensatz, Discrete Appl. Math. 33 (1991) 11-23.
16. D. Castro, K. Hägele, J.L. Montaña, L.M. Pardo, Probabilistic Zero Test for Elimination Polynomials, preprint, May 1998.
17. A.L. Chistov, Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic, Lecture Notes in Computer Science, vol. 199, Springer, Berlin, 1985, pp. 63-69.
18. A. Chistov, Polynomial complexity algorithm for factoring polynomials and constructing components of a variety in subexponential time, J. Sov. Math. 34 (1986).
19. S.A. Cook, The complexity of theorem-proving procedures, Proc. 3rd Annual ACM Symp. on Theory of Computing, 1971, pp. 151-158.
20. L. Csanky, Fast parallel matrix inversion algorithms, SIAM J. Comput. 5(4) (1976) 618-623.
21. T.W. Dubé, A combinatorial proof of effective Nullstellensatz, J. Symbolic Comput. 15 (1993) 277-296.
22. N. Fitchas, A. Galligo, Nullstellensatz effectif et conjecture de serre (théorème de quillen-suslin) pour le calcul formel, Math. Nachr. 149 (1990) 231-253.
23. N. Fitchas, M. Giusti, F. Smietanski, Sur la complexité du théorème des zéros, in: J. Guddat (Ed.), Approximation and Optimization in the Caribbean II, Proc. 2nd Int. Conf. on Non-linear Optimization and Approximation, Approximation and Optimization, vol. 8, Peter Lange Verlag, Frankfurt am Main, 1995, pp. 247-329.
24. W. Fulton, Intersection Theory, 2nd Ed., Ergebnisse der Mathematik, vol. 3, Springer, Berlin, 1984.
25. M. Giusti, K. Hägele, J. Heintz, J.E. Morais, J.L. Montaña, L.M. Pardo, Lower bounds for diophantine approximation, J. Pure Appl. Algebra 117-118 (1997) 277-317.
26. M. Giusti, J. Heintz, Algorithmes - Disons rapides - Pour la décomposition d'une variété algébrique en composantes irréductibles etéquidimensionelles, in: T. Mora, C. Traverso (Eds.), Proc. MEGA'90, Progress in Mathematics, vol. 94, Birkhäuser, Basel 1991, pp. 169-194.
27. M. Giusti, J. Heintz, La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial, in: D. Eisenbud, L. Robbiano (Eds.), Computational Algebraic Geometry and Commutative Algebra, Symposia Matematica, vol. XXXIV, Cambridge University Press, Cambridge, 1993, pp. 216-256.
28. M. Giusti, J. Heintz, J.E. Morais, J. Morgenstern, L.M. Pardo, Straight-line programs in geometric elimination theory, J. Pure Appl. Algebra 124 (1998) 101-146.
29. M. Giusti, J. Heintz, J.E. Morais, L.M. Pardo, When polynomial equation systems can be solved fast? in: G. Cohen, H. Giusti, T. Mora (Eds.), Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Proc. AAECC-11, Lecture Notes in Computer Science, vol. 948, Springer, Berlin, 1995, pp. 205-231.
30. M. Giusti, J. Heintz, J.E. Morais, L.M. Pardo, Le rôle des structures de données dans les problèmes d'élimination, C. R. Acad. Sci. Paris 325 (1997) 1223-1228.
31. M. Giusti, J. Heintz, J. Sabia, On the efficiency of effective nullstellensätze, Comput. Complexity 3 (1993) 56-95.
32. D. Grigoriev, Polynomial factoring over a finite field and solving systems of algebraic equations, J. Soviet Math. 34 (1986) 1762-1803.
33. K. Hägele, Intrinsic Height Estimates for the Nullstellensatz, Ph.D. Thesis, Universidad de Cantabria, Santander, Spain, 1998.
34. J. Heintz, Definability and fast quantifier elimination in algebraically closed fields, Theoret. Comput. Sci. 24 (3) (1983) 239-277.
35. J. Heintz, On the computational complexity of polynomials and bilinear mappings. A survey, in: Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Proc. AAECC-5, Lecture Notes in Computer Science, vol. 356, Springer, Berlin, 1989, pp. 269-300.
36. J. Heintz, C.P. Schnorr, Testing polynomials which are easy to compute, in: Logic and Algorithmic, Monographie de l'Enseignement Mathématique, vol. 30, 1982, pp. 237-254.
37. G. Hermann, Die Frage der endlich vielen Schritte in der Theorie de Polynomideale, Math. Ann. 95 (1926) 736-788.
38. O.H. Ibarra, S. Moran, Equivalence of straight-line programs, J. ACM 30 (1983) 217-228.
39. B. Iversen, Generic local structure of the morphisms in commutative algebra, Lecture Notes in Mathematics, vol. 310, Springer, Berlin, 1973.
40. J.P. Jouanolou, Théorèmes de bertini et applications, Progress in Mathematics, Birkhäuser, Basel, 1983.
41. P. Koiran, Hilbert's Nullstellensatz is in the polynomial hierarchy, J. Complexity 12 (4) (1996) 273-286.
42. J. Kollár, Sharp effective Nullstellensatz, J. AMS 1 (1988) 963-975.
43. T. Krick, L.M. Pardo, Une approche informatique pour l' approximation diophantienne, C. R. Acad. Sci. Paris 318 (1) (1994) 407-412.
44. T. Krick, L.M. Pardo, A computational method for diophantine approximation, in: L. González-Vega, T. Recio (Eds.), Algorithms in Algebraic Geometry and Applications, Proc. MEGA'94, Progress in Mathematics, vol. 143, Birkhäuser, Basel, 1996, pp. 193-254.
45. T. Krick, J. Sabia, and P. Solernó, On intrinsic bounds in the Nullstellensatz, Appl. Algebra Eng. Commun. Comput. (AAECC J.) 8 (1997) 125-134.
46. L. Kronecker, Grundzüge einer arithmetischen theorie de algebraischen grössen, J. Reine Angew. Math. 92 (1882) 1-122.
47. E. Kunz, Introduction to Commutative Algebra and Algebraic Geometry, Birkhäuser, Basel, 1985.
48. E. Kunz, Kähler Differentials, Advanced Lectures in Mathematics, Vieweg, Braunschweig, 1986.
49. T.Y. Lam, Serre's Conjecture, Lecture Notes in Mathematics, vol. 635, Springer, Berlin, 1978.
50. S. Lang, Fundamentals of Diophantine Geometry, Springer, Berlin, 1983.
51. D.H. Lehmer, Factorization of certain cyclotomic functions, Ann. Math. 34 (2) (1933) 461-479.
52. F.S. Macauley, The Algebraic Theory of Modular Systems, Cambridge University Press, Cambridge, 1916.
53. G. Matera, Sobre la Complejidad en Espacio y Tiempo de la Eliminación Geométrica, Ph.D. Thesis, Universidad de Buenos Aires, Argentina, 1997.
54. H. Matsumura, Commutative Ring Theory, Cambridge University Press, Cambridge, 1986.
55. P.J. McCarthy, Algebraic Extensions of Fields, Chelsea, New York, 1976.
56. H.M. Möller, F. Mora, Upper and lower bounds for the degree of Groebner bases, in: J. Fitch (Ed.), Proc. Int. Symp. on Symbolic and Algebraic Computation (EUROSAM 84), Lecture Notes in Computer Science, vol. 174, Springer, Berlin, 1984, pp. 172-183.
57. J.L. Montaña, J.E. Morais, L.M. Pardo, Lower bounds for arithmetic networks II: Sum of Betti numbers, Appl. Algebra Eng. Commun. Comput. 7 (1996) 41-51.
58. J.L. Montaña, L.M. Pardo, Lower bounds for arithmetic networks, in: Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Proc. AAECC-4, Springer, Berlin, 1993, pp. 1-24.
59. J.L. Montaña, L.M. Pardo, T. Recio, The non-scalar model of complexity in computational geometry, in: C. Traverso, T. Mora (Eds.), Effective Methods in Algebraic Geometry, Proc. MEGA'90, Progress in Mathematics, vol. 94, Birkhäuser, Basel, 1991, pp. 347-361.
60. J.E. Morais, Resolución Eficaz de Sistemas de Ecuaciones Polinomiales, Ph.D. Thesis, Universidad de Cantabria, Santander, Spain, 1997.
61. Y. Nesterenko, On algebraic independence of algebraic powers of algebraic numbers, Math. USSR. Sbornik 51 (2) (1985) 429-455.
62. Y. Nesterenko, On a measure of the algebraic independence of the values of certain functions, Math. USSR. Sbornik 56 (2) (1987) 545-567.
63. L.M. Pardo, How lower and upper complexity bounds meet in elimination theory, in: G. Cohen, H. Giusti, T. Mora (Eds.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Paris, 1995), Lecture Notes in Computer Science, vol. 948, Springer, Berlin, 1995, pp. 33-69.
64. P. Philippon, Critères pour l'indépendance algébrique, Pub. Math, de l'IHES 64 (1986) 5-52.
65. P. Philippon, Denominators in Hilbert's Nullstellensatz, Acta Arith. 58 (1991) 1-25.
66. P. Philippon, Sur des hauteurs alternatives, I. Math. Ann. 289 (1991) 255-283.
67. P. Philippon, Sur des hauteurs alternatives, II. Ann. Inst. Fourier, Grenoble 44 (2) (1994) 1043-1065.
68. P. Philippon, Sur des hauteurs alternatives, III. J. Math. Pures Appl. 74 (1995) 345-365.
69. F. Rossi, W. Spangher, Some effective methods in the openness of loci for Cohen-Macaulay and Gorenstein properties, in: T. Mora, C. Traverso (Eds.), Proc. MEGA'90, Progress in Mathematics, vol. 94, Birkhäuser, Basel, 1991, pp. 441-455.
70. J. Sabia, P. Solernó, Bounds for traces in complete intersections and degrees in the Nullstellensatz, Appl. Algebra Eng. Commun. Comput. (AAECC J.) 6 (1996) 353-376.
71. A. Schönhage, On the power of random access machines, in: H.A. Maurer (Ed.), Proc. 6th Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 71, Springer, Berlin, July 1979, pp. 520-529.
72. J.T. Schwartz, Probabilistic algorithms for verification of polynomial identities, ISSAC '79: Proc. Int. Symp. on Symbolic and Algebraic Computation, Lecture Notes in Computer Science, vol. 72, Springer, Berlin, 1979.
73. M. Shub, S. Smale, Complexity of Bézout's theorem I: Geometric aspects, J. AMS 6 (2) (1993) 459-501.
74. M. Shub, S. Smale, Complexity of Bézout's theorem II: Volumes and probabilities, Proc. Effective Methods in Algebraic Geometry, Progress in Mathematics, vol. 109, MEGA '92, Niece, Birkhäuser, Basel, 1993, pp. 267-285.
75. M. Shub, S. Smale, Complexity of Bézout's theorem III: Condition number and packing, J. Complexity 9 (1993) 4-14.
76. M. Sombra, Bounds for the Hilbert function of polynomial ideal and for the degrees in the Nullstellensatz, J. Pure Appl. Algebra 117-118 (1997) 565-599.
77. M. Sombra, Estimaciones Para el Teorema de Ceros de Hilbert, Ph.D. Thesis, Universidad de Buenos Aires, Argentina, 1998.
78. M. Sombra, A sparse effective Nullstellensatz, Adv. Appl. Math., to appear.
79. V. Strassen, Vermeidung von Divisionen, Crelle J. Reine Angew. Math. 264 (1973) 182-202.
80. V. Strassen, Algebraic complexity theory, in: Handbook of Theoretical Computer Science, Ch. 11, Elsevier, Amsterdam, 1990, pp. 634-671.
81. B.L. Van der Waerden, Moderne Algebra I, Springer, Berlin, 1930.
82. W. Vogel, Results on BéZout's Theorem, Tata Institute of Fundamental Research, Springer, Berlin, 1984.
83. O. Zariski, Algebraic Surfaces, Classics in Mathematics, Springer, Berlin, 1995.
84. O. Zariski, P. Samuel, Commutative Algebra, Graduate Texts in Mathematics, vol. 2, Springer, New York, 1960.
85. R. Zippel, Probabilistic algorithms for sparse polynomials, in: Proc. EUROSAM' 79, Lecture Notes in Computer Science, vol. 72, Springer, Berlin, 1979, pp. 216-226.
86. R. Zippel, Interpolating polynomials from their values, J. Symbolic Comput. 9 (1990) 147-175.
87. R. Zippel, Effective Polynomial Computation, ECS 241, Kluwer Academic Publishers, Dordrecht, 1993.