Deformation Techniques for Efficient Polynomial Equation Solving

Journal of Complexity

Volumn 16, Issue 1, 2000, Pages 70-109

  Heintz, Joos ^a,b   Krick, Teresa ^a   Puddu, Susana ^a   Sabia, Juan ^a   Waissbein, Ariel ^a  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b UNIVERSITY OF CANTABRIA   (Spain)

Author keywords

Polynomial equation system; arithmetic circuit; shape (or primitive element) lemma; Newton Hensel iteration

Indexed keywords

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

References (56)

1. Auzinger W., Stetter H. J. An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations. International Series of Numerical Mathematics. 1988;Birkhäuser, Basel. p. 11-30.
2. Bürgisser P., Clausen M., Amin Shokrollahi M. Algebraic Complexity Theory. Grundlehren der Mathematischen Wissenschaften. 315:1997;Springer-Verlag, New York/Berlin.
3. Bass H., Connelle E., Wright T. The Jacobian conjecture: Reduction of degree and formal expansion of the inverse. Bull. Amer. Math. Soc. 7:1982;287-330.
4. Berkowitz S. J. On computing the determinant in small parallel time using a small number of processors. Inform. Process. Lett. 18:1984;147-150.
5. Bank B., Giusti M., Heintz J., Mbakop G. Polar varieties and efficient real equation solving: The hypersurface case. J. Complexity. 13:1997;5-27.
6. Borodin A. Time space tradeoffs (getting closer to the barrier?). Algorithms and Computation, Proceedings 4, ISSAC. Lecture Notes in Comput. Sci. 762:1993;Springer-Verlag, New York/Berlin. p. 209-220.
7. Basu S., Pollack R., Roy M.-F. On computing a set of points meeting every cell defined by a family of polynomials on a variety. J. Complexity. 13:1997;28-37.
8. Bruno N. Esquemas de compilación de circuitos aritméticos uniformes descriptos por medio de funciones generatrices. 1998;Universidad de CórdobaFaMAF.
9. Buchberger B. Gröbner bases: An algorithmic method in polynomial ideal theory. Bose N. K. Multidimensional System Theory. 1985;374-383 Reidel, Dordrecht.
10. Canny J. Generalised characteristic polynomials. J. Symbolic Comput. 9:1990;241-250.
11. Castro D. Sobre la complejidad de la aproximación diofántica y los fundamentos del análisis numérico. 1997;Universidad de Cantabria, Santander.
12. A. L. Chistov, and, D. Y. Grigoriev, Subexponential time solving systems of algebraic equations, LOMI preprint E-9-83, E-10-83, Steklov Institute, Leningrad, 1983.
13. Colin A. Théorie des invariants effective. 1997;Ecole Polytechnique, Palaiseau-Paris.
14. Fulton W. Intersection Theory. Ergebnisse der Mathematik. 1984;Springer-Verlag, New York/Berlin.
15. Giusti M., Heintz J. La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial. Eisenbud D., Robbiano L. Computational Algebraic Geometry and Commutative Algebra, Symposia Mathematica. 1993;216-256 Cambridge Univ. Press, Cambridge.
16. Giusti M., Hägele K., Heintz J., Morais J. E., Montaña J. L., Pardo L. M. Lower bounds for diophantine approximation. J. Pure Appl. Algebra. 117-118:1997;277-317.
17. Giusti M., Hägele K., Lecerf G., Marchand J., Salvy B. Research Report. July 1997.
18. Giusti M., Heintz J., Morais J. E., Morgenstern J., Pardo L. M. Straight-line programs in geometric elimination theory. J. Pure Appl. Algebra. 124:1998;101-146.
19. Giusti M., Heintz J., Morais J. E., Pardo L. M. Le rôle des structures de données dans les problèmes d'élimination. C. R. Acad. Sci. Paris. 325:1997;1223-1228.
20. Gianni P., Mora T. Algebraic solution of systems of polynomial equations using Gröbner bases. Proceedings AAECC-5. Lecture Notes in Comput. Sci. 356:1989;Springer-Verlag, New York/Berlin. p. 247-257.
21. Grigoriev D. Yu., Vorobjov N. N. Jr. Solving systems of polynomial inequalities in sub-exponential time. J. Symbolic Comput. 5:1988;37-64.
22. Heintz J. Definability and fast quantifier elimination in algebraically closed fields. Theoret. Comput. Sci. 24:1983;239-277.
23. K. Hägele, J. E. Morais, L. M. Pardo, and, M. Sombra, On the intrinsic complexity of the arithmetic Nullstellensatz, J. Pure Appl. Algebra, in press.
24. Heintz J., Roy M.-F., Solernó P. Sur la complexité du principe de Tarski-Seidenberg. Bull. Soc. Math. France. 118:1990;101-126.
25. Iversen B. Generic local structure of the morphisms in commutative algebra. Lecture Notes in Math. 1973;Springer-Verlag, New York/Berlin.
26. Kaltofen E. Computing with polynomials given by straight-line programs. I. Greatest common divisors. Proceedings of the 17th Ann. ACM Symposium on Theory of Computing, Providence, RI. 1985;ACM Press, New York. p. 131-142.
27. Koenig J. Einleitung in die allgemeine Theorie der algebraischen Grössen. 1903;Teubner, Leipzig.
28. Kovacs P. Minimum degree solutions for the inverse kinematics problem by application of the Buchberger algorithm. Proceedings of the 2nd Int. Workshop on Advances in Robot Kinematics, University of Linz, Austria, September 10-12, 1990. 1990;Springer-Verlag, New York/Berlin.
29. Krick T., Pardo L. M. A computational method for diophantine approximation. González-Vega L., Recio T. Algorithms in Algebraic Geometry and Applications, Proceedings of MEGA'94. Progress in Mathematics. 143:1996;193-254 Birkhäuser Verlag, Basel.
30. Kronecker L. Grundzüge einer arithmetischen Theorie de algebraischen Grössen. J. Reine Angew. Math. 92:1882;1-22.
31. Gonzalez Lopez M. J., Gonzalez Vega L. Newton identities in the multivariate case: Pham systems. London Mathematical Society Lecture Notes Series. 1998;Cambridge Univ. Press, Cambridge. p. 351-366.
32. Macaulay F. S. Algebraic Theory of Module Systems. 1916;Cambridge Univ. Press, Cambridge.
33. Matera G. Sobre la complejidad en espacio y tiempo de la eliminación geométrica. 1997;Universidad de Buenos Aires.
34. Mishra B. Algorithmic Algebra. 1993;Springer-Verlag, New York.
35. Morais J. E. Resolución eficaz de sistemas de ecuaciones polinomiales. 1997;Universidad de Cantabria, Santander.
36. Mourrain B., Pan V. Solving special polynomial systems by using structural matrices and algebraic residues. Cucker F., Shub M. Proceedings Foundations of Computational Mathematics, FOCM'97. 1997;287-304 Springer-Verlag, New York/Berlin.
37. Narasimhan R. Introduction to the theory of analytic spaces. Lecture Notes in Math. 1966;Springer-Verlag, New York/Berlin.
38. Renegar J. On the computational complexity and geometry of the first-order theory of the reals. Part I. Introduction, preliminaries, the geometry of semi-algebraic sets, the decision problem for the existential theory of the reals. J. Symbolic Comput. 13:1992;255-299.
39. Schmid J. On the affine Bézout inequality. Manuscripta Math. 88:1995;225-232.
40. Schönhage A., Grotefeld F. W., Vetter E. Fast Algorithms: A Multitape Turing Machine Implementation. 1994;Wissenschaftsverlag, Mannheim.
41. Sombra M. Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz. J. Pure Appl. Algebra. 117-118:1997;565-599.
42. Shub M., Smale S. Complexity of Bézout's theorem. I. Geometric aspects. J. Amer. Math. Soc. 6:1993;459-501.
43. Shub M., Smale S. Complexity of Bézout's theorem. II. Volumes and probabilities. Proceedings of MEGA'92. Progress in Mathematics. 109:1993;Birkhäuser Verlag, Basel. p. 267-285.
44. Shub M., Smale S. Complexity of Bézout's theorem. III. Condition number and packing. J. Complexity. 9:1993;4-14.
45. Shub M., Smale S. Complexity of Bézout's theorem. V. Polynomial time. Theoret. Comput. Sci. 133:1994;141-164.
46. Sabia J., Solernó P. Bounds for traces in complete intersections and degrees in the Nullstellensatz. Appl. Algebra Engrg. Comm. Comput. 6:1996;353-376.
47. Shub M., Smale S. Complexity of Bezout's theorem. IV. Probability of success and extensions. SIAM J. Numer. Anal. 33:1996;128-148.
48. Strassen V. Vermeidung von Divisionen. J. Reine Angew. Math. 264:1973;182-202.
49. TERA Development Group, Some remarks on the time-space tradeoff of geometric elimination procedures, manuscript, 1997.
50. Vallibouze A. Computations of the Galois groups of the resolvent factors for the direct and indirect Galois problem. Giusti M., Cohen G., Mora T. Proceedings of AAECC-11. Lecture Notes in Comput. Sci. 948:1995;456-468 Springer-Verlag, New York/Berlin.
51. Verschelde J., Haegemans A. Homotopies for solving polynomial systems within a bounded domain. Theoret. Comput. Sci. 133:1994;165-185.
52. Vogel W. Results on Bezout's Theorem. 1984;Springer-VerlagTata Institute of Fundamental Research, New York/Berlin.
53. von zur Gathen J. Parallel arithmetic computations: A survey. Rovan B., Gruska J., Wiedermann J. Proceedings of the 12th Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Comput. Sci. 233:1986;93-112 Springer-Verlag, New York/Berlin.
54. von zur Gathen J. Parallel linear algebra. Reif J. H. Synthesis of Parallel Algorithms. 1993;573-617 San Mateo, CA.
55. Weispfenning V., Becker T. Groebner Bases: A Computational Approach to Commutative Algebra. Graduate Texts in Mathematics. 141:1993;Springer-Verlag, New York/Berlin.
56. Zariski O. Algebraic Surfaces. Classics in Mathematics. 1995;Springer-Verlag, New York/Berlin.