Straight-line programs in geometric elimination theory

Journal of Pure and Applied Algebra

Volumn 124, Issue 1-3, 1998, Pages 101-146

  Giusti, M ^a   Heintz, J ^b   Morais, J E ^b   Morgenstern, J ^c   Pardo, L M ^b  

^a ECOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF CANTABRIA   (Spain)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031992346     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-4049(96)00099-0     Document Type: Article

References (65)

1. [1] M.E. Alonso, E. Becker, M.-F. Roy and T. Wörmann, Zeroes, multiplicites and idempotents for zerodimensional systems, Proc. MEGA'94, Birkhäuser Progress in Mathematics, to appear.
2. [2] W. Baur and V. Strassen, The complexity of partial derivatives, Theoret. Comput. Sci. 22 (1982) 317-330.
3. n], Acta Math. 166 (1991) 69-120.
4. ieme série, 24 (1991) 363-377.
5. [5] S.J. Berkowitz, On computing the determinant in small parallel time using a small number of processors, Inf. Proc Lett. 18 (1984) 147-150.
6. [6] J. Briançon, Sur le degré des relations entre polynômes, C.R. Acad. Sci. Paris Sér. I Math. 297 (1982) 553-556.
7. [7] D.W. Brownawell, Bounds for the degree in the Nullstellensatz, Ann. Math. 126 (1987) 577-591.
8. [8] L. Caniglia, A. Galligo and J. Heintz, Borne simplement exponentielle pour les degrés dans le théorème des zéros sur un corps de caractéristique quelconque, C.R. Acad. Sci. Paris. Sér. I Math. 307 (1988) 255-258.
9. [9] L. Caniglia, A. Galligo and J. Heintz, Some new effectivity bounds in computational geometry in: T. Mora, Ed., Proc. AAECC-6, Lecture Notes in Computer Science, Vol. 357 (Springer, Berlin, 1989) 131-152.
10. [10] J. Canny, Some algebraic and geometric problems in PSPACE, Proc. 20th Ann. ACM Symp. Theory of computing (1988) 460-467.
11. [11] A.L. Chistov, Polynomial-time computation of the dimension of components of algebraic varieties in zero-characteristic, preprint, Université Paris Val de Marne.
12. [12] A.L. Chistov and D.Yu. Grigor'ev, Subexponential time solving systems of algebraic equations, LOMI Preprints E-9-83, E-10-83, Leningrad, 1983.
13. [13] F. Cucker, M. Karpinski, P. Koiran, T. Lickteig and K. Werther, On real Turing machines that toss coins, manuscript University Bonn, 1995.
14. m, Y), J. Number Theory 42(2) (1992) 141-157.
15. [15] R.A. De Millo and R.J. Lipton, A probabilistic remark on algebraic program testing, Inform. Process. Lett. Vol. 7 (4) (1978) 193-195.
16. [16] A. Dickenstein, N. Fitchas, M. Giusti and C. Sessa, The membership problem of unmixed ideals is solvable in single exponential time, Discrete Appl. Math. 33 (1991) 73-94.
17. [17] T.W. Dubé, A combinatorial proof of effective Nullstellensatz, J. Symbol. Comput. 15 (1993) 277-296.
18. [18] D. Duval, Évaluation dynamique et clôture algébrique en axiom, J. Pure Appl. Algebra 99 (1995) 267-295.
19. [19] N. Fitchas, M. Giusti and F. Smietanski, Sur la complexité du théorème des zéros, in: M. Florenzano et al., Eds., Approximation and Optimization in the Caribbean II, Proc. 2nd Internat. Conf. on Approximation and Optimization, La Habana, 1993, Approximation and Optimization (Peter Lang Verlag, Frankfurt, 1995) 274-329.
20. [20] M. Fried, On the Sprindžuk-Weissauer approach to universal Hilbert subsets, Israel J. Math. 51 (4) (1985) 347-363.
21. [21] W. Fulton, Intersection Theory, Ergebnisse der Mathematik, 3 Folge, Band 2 (Springer, Berlin, 1984).
22. [22] C.B. García and W.I. Zangwill, Pathways to Solutions, Fixed Points and Equilibria (Prentice-Hall, Englewood Cliffs, NJ, 1981).
23. [23] J. von zur Gathen, Parallel arithmetic computations: a survey, Proc. 13th Conf. MFCS, Lecture Notes in Computer Science, Vol. 233 (Springer, Berlin, 1986) 93-112.
24. [24] M. Giusti and 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 and L. Robbiano, Eds., Computational Algebraic Geometry and Commutative Algebra, Proc. Cortona Conf. on Computational Algebraic Geometry and Commutative Algebra, Symposia Matematica, Vol. XXXIV, Istituto Nazionale di Alta Matematica (Cambridge Univ. Press, Cambridge, 1993).
25. [25] M. Giusti, J. Heintz, J.E. Morais and L.M. Pardo, When polynomial equation systems can be "solved" fast? in: G. Cohen, M. Giusti and T. Mora, Eds., Proc. 11th Internat. Symp. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-11, Paris 1995, Lecture Notes in Computer Science, Vol. 948 (Springer, Berlin, 1995) 205-231.
26. [26] M. Giusti, J. Heintz and J. Sabia, On the efficiency of effective Nullstellensätze, Comput. Complexity 3 (1993) 56-95.
27. [27] L. González Vega and G. Trujilo, Using symmetric functions to describe the solution of a zero-dimensional ideal, in: G. Cohen, M. Giusti and T. Mora, Eds., Proc. 11th Internat. Symp. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-11, Paris 1995, Lecture Notes in Computer Science, Vol. 948 (Springer, Berlin, 1995) 232-247.
28. [28] K. Haegele and J.L. Montaña, Polynomial random test for the equivalence problem of integers given by arithmetic circuits, manuscript, Universidad de Cantabria, 1995.
29. [29] J. Heintz, Fast quantifier elimination over algebraically closed fields, Theoret. Comput. Sci. 24 (1983) 239-277.
30. [30] J. Heintz, On the computational complexity of polynomials and bilinear mappings, in: L. Huguet and A. Poli, Eds., Proc., 5th Internat. Conf. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes AAECC-5, Menorca 1987, Lecture Notes in Computer Science, Vol. 356 (Springer, Berlin, 1989) 269-300.
31. [31] J. Heintz and J. Morgenstern, On the intrinsic complexity of elimination theory, J. Complexity 9 (1993) 471-498.
32. [32] J. Heintz and C.P. Schnorr, Testing Polynomials which are easy to compute, Proc. 12th Ann. ACM Symp. on Computing (1980) 262-268; also in Logic and Algorithmic. An Internat. Symp. held in Honour of Ernst Specker, Monographie No. 30 de l'Enseignement de Mathématiques, Genève (1982) 237-254.
33. [32] J. Heintz and C.P. Schnorr, Testing Polynomials which are easy to compute, Proc. 12th Ann. ACM Symp. on Computing (1980) 262-268; also in Logic and Algorithmic. An Internat. Symp. held in Honour of Ernst Specker, Monographie No. 30 de l'Enseignement de Mathématiques, Genève (1982) 237-254.
34. [33] J. Heintz and M. Sieveking, Absolute primality of polynomials is decidable in random polynomial time in the number of the variables, Proc. 8th Internat. Colloq. on Automata, Languages and Programming ICALP 81, Lecture Notes in Computer Science, Vol. 115 (Springer, Berlin, 1981) 16-28.
35. [34] O. Ibarra and H. Moran, Probabilistic algorithms for deciding equivalence of straight-line programs, J. ACM 30(1) (1983) 217-228.
36. [35] B. Iversen, Generic Local Structures of the Morphisms in Commutative Algebra, Lecture Notes in Math., Vol. 310 (Springer, Berlin, 1973).
37. [36] J. Ja'Ja', An Introduction to Parallel Algorithms (Addison-Wesley, Reading, MA, 1992).
38. [37] E. Kaltofen, Greatest common divisors of polynomials given by straight line programs, J. ACM 35 (1) (1988) 234-264.
39. [38] E. Kaltofen, Factorization of polynomials given by striaght-line programs, in: S. Micali, Ed., Randomness in Computation, Advances in Computing Research 5 (JAI Press Inc., Greenwich, CT, 1989) 375-412.
40. [39] J. Kollár, Sharp effective Nullstellensatz, J. AMS 1 (1988) 963-975.
41. [40] T. Krick and L.M. Pardo, Une approche informatique pour l'approximation diophantienne, C.R. Acad. Sci. Paris, Sér. 318 (1994) 407-412.
42. [41] T. Krick and L.M. Pardo, A computational method of diophantine approximation, Proc. MEGA'94 Birkhäuser Progress in Mathematics, to appear.
43. [42] E. Kunz, Kähler Differentials, Advanced Lectures in Mathematics (Vieweg Verlag, Braunschweig, 1986).
44. [43] Y.N. Lakshman and D. Lazard, On the complexity of zero-dimensional algebraic systems, in: C. Traverso, Ed., Proc. MEGA'90, Progress in Mathematics, Vol. 94 (Birkhäuser, Boston, 1991) 217-225.
45. [44] D. Lazard, Résolution des systèmes d'équations algébriques, Theoret. Comput. Sci. 15 (1981) 77-110.
46. [45] A.K. Lenstra, H.W. Lenstra and L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982) 515-534.
47. [46] F.S. Macaulay, The Algebraic Theory of Modular Systems (Cambridge Univ. Press, Cambridge, 1916).
48. [47] M. Moeller, Systems of algebraic equations solved by means of endomorphisms, in: G. Cohen, T. Mora and O. Moreno, Eds., Proc. 10th Internat. Conf. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes AAECC-10, Puerto Rico 1993, Lecture Notes in Computer Science (Springer, Berlin, 1993).
49. [48] J.L. Montaña and L.M. Pardo, Lower bounds for arithmetic networks, AAECC 4 (1993) 1-24.
50. [49] J. Morgenstern, How to compute fast a function and all its derivatives, Prépublication No. 49, Université de Nice, 1984.
51. [50] L.M. Pardo, How lower and upper complexity bounds meet in elimination theory, Proc. 11th Internat. Symp. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-11, Paris 1995, Lecture Notes in Computer Science, Vol. 948 (Springer, Berlin, 1995) 33-69.
52. [51] P. Philippon, Dénominateurs dans le théorème des zéros de Hilbert, Acta Arith. 58 (1991) 1-25.
53. [52] J. Sabia and P. Solernó, Bounds for traces in complete intersections and degrees in the Nullstellensatz, AAECC 6 (1995) 353-376.
54. [53] J. Sabia and P. Solernó, On intrinsic bounds in the Nullstellensatz, manuscript, Univ. de Buenos Aires, 1995.
55. [54] A. Schönhage, On the power of random acces machines, Proc. 6th Internat. Conf. on Automata, Languages and Programming, ICALP, Graz (1979) 520-529.
56. [55] J.T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities, J. ACM 27 (1980) 701-717.
57. [56] M. Shub and S. Smale, Complexity of Bezout's theorem V: polynomial time, Theoret. Comput. Sci. 133 (1994) 141-164.
58. [57] M. Shub and S. Smale, On the intractability of Hilbert's Nullstellensatz and an algebraic version of NP ≠ P?, IBM Research Report, Yorktown Heights, 1994.
59. [58] V.G. Sprindžuk, Diophantine equations involving unknown primes, Trudy MIANSSR 158 (1981) 180-196.
60. [59] V. Strassen, Vermeidung von Divisionen, Crelle J. Reine Angew. Math. 264 (1973) 184-202.
61. [60] V. Strassen, Die Berechungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoffizienten, Numer. Math. 20 (1973) 238-251.
62. [61] V. Strassen. Algebraic complexity theory, in: Handbook of Theoretical Computer Science, Vol. 11 (Elsevier, Amsterdam, 1990) 634-671.
63. [62] M. Yasumoto, Nonstandard arithmetic and Hilbert's irreducible sequences, manuscript.
64. [63] P. Zariski and O. Samuel, Commutative Algebra II, Graduate Texts in Mathematics, Vol. 29 (Springer, Berlin, 1960).
65. [64] R.E. Zippel, Probabilistic algorithms for sparse polynomials, Lecture Notes in Computer Science, Vol. 72 (Springer, Berlin, 1979) 216-226.