When polynomial equation systems can be “solved” fast?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 948, Issue , 1995, Pages 205-231

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

^a ECOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF CANTABRIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; GEOMETRY; POLYNOMIALS;

ARITHMETIC NETWORK; COMPLEXITY BOUNDS; NEWTON ITERATIONS; NUMERIC COMPUTATION; POLYNOMIAL EQUATION SYSTEM; SPARSE REPRESENTATION; STRAIGHT LINE PROGRAM; WORST-CASE COMPLEXITY;

ITERATIVE METHODS;

EID: 84955611783     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (49)

1. M. E. Alonso, E. Becker, M.-F. Roy, T. Wŏrmann: Zeroes, multiplicities and idem-potents for zerodimensional systems, to appear in Proc. MEGA'94, Birkhäuser Progress in Mathematics.
2. n], Acta Math., 166 (1991) 69-120.
3. eme série, 24 (1991) 363-377.
4. S. J. Berkowitz: On computing the determinant in small parallel time using a small number of processors, Inf. Proc. Letters 18 (1984) 147-150.
5. J. Briancon: Sur le degré des relations entre polynômes, Comptes Rendues de Acad. des Sci. Paris, t., Série I Math (1982) 553-556.
6. D. W. Brownawell: Bounds for the degree in the Nullstellensatz, Annals of Math. 126 (1987) 577-591.
7. L. Caniglia, A. Galligo and J. Heintz: Some new effectivity bounds in computational geometry, In Proc. AAECC-6, T. Mora (Ed.), Springer LN in Comp. Sci. 357(1989) 131-152.
8. L. Caniglia, A. Galligo and J. Heintz: Borne simplement exponentielle pour les degrés dans le théorème des zeros sur un corps de caractéristique quelconque, C. R. Acad. Sci. Paris, Série I, Math. 307 (1988) 255-258.
9. J. Canny: Some algebraic and geometric problems in PSPACE, Proc. 20-th Ann. ACM Symp. Theory of Computing (1988) 460-467.
10. A. Ł. Chistov: Polynomial-time computation of the dimension of components of algebraic varieties in zero-characteristic, Preprint Université Paris Vaì de Marne.
11. A. L. Chistov, D. Yu. Grigor'ev: Subexponential time solving systems of algebraic equations, LOMI Preprints E-9-83, E-10-83, Leningrad (1983).
12. F. Cucker, M. Karpinski, P. Koiran, T. Lickteig, K. Werther: On real Turing machines that toss coins.
13. R. A. De Millo, R. J. Lipton: A probabilistic remark on algebraic program testing, Inf. Proc. Letters, vol. 7, No. 4 (1978) 193-195.
14. A. Dickenstein, N. Fitchas, M. Giusti, C. Sessa: The membership problem of unmixed ideals is solvable in single exponential time, Discrete Applied Mathematics 33 (1991) 73-94.
15. T. W. Dubé: A combinatorial proof of Effective Nullstellensatz, J. Symb. Comp. 15 (1993) 277-296.
16. D. Duval: Evaluation Dynamique et cloture algébrique en Axiom, Journal of Pure and Applied Algebra (1994).
17. N. Fitchas, M. Giusti and F. Smietanski: Sur la complexité du théorème des zeros, to appear in Proceedings of the Second International Conference on Approximation and Optimization, La Habana, 1993, J. Gudatt, ed., Peter Lang Verlag, Frankfurt (1995).
18. W. Fulton: Intersection theory, Ergebnisse der Mathematik, 3 Folge Band 2, Springer Verlag (1984).
19. C. B. García and W. I. Zangwill: Pathways to solutions, fixed points and equilibria, Prentice-Hall, N. J. (1981).
20. J. von zur Gathen: Parallel arithmetic computations: a survey, Proc. 13-th Conf. MFCS. Springer LN Comp. Sci. 233(1986) 93-112.
21. M. Giusti and J. Heintz: La determination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial, In Computational Algebraic Geometry and Commutative Algebra, Proceedings of the Cortona Conference on Computational Algebraic Geometry and Commutative Algebra, D. Eisenbud and L. Robbiano, eds., Symposia Matematica, vol. XXXIV, Istituto Nazionale di Alta Matematica, Cambridge University Press (1993).
22. M. Giusti, J. Heintz and J. Sabia: On the efficiency of effective Nullstellensătze, Computational Complexity 3 (1993) 56-95.
23. L. Gonzalez Vega, G. Trujillo: Using symmetric functions to describe the solution of a zero-dimensional ideal, in this volume.
24. K. Haegele, J. L. Montana: Polynomial random test for the equivalence problem of integers given by arithmetic circuits. Stasiakte Humboldt-Universität. Preprint Series X901-B.
25. J. Heintz: Fast quantifier elimination over algebraically closed fields, Theoret. Comp. Sci. 24 (1983) 239-277.
26. J. Heintz: On the computational complexity of polynomials and bilinear mappings, in Proc. 5th International Conference Applied Algebra, Algebraic Algorithms and Error-Correcting Codes AAECC-5, Menorca 1987, L. Huguet and A. Poli, eds., Springer LN Comput. Sci. 356 (1989) 269-300.
27. J. Heintz and J. Morgenstern: On the intrinsic complexity of elimination theory, J. of Complexity 9 (1993) 471-498.
28. S. 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 International Symposium held in Honour of Ernst Specker, Monographie No. 30 de l'Enseignement de Mathématiques, Genève (1982) 237-254.
29. J. Heintz and M. Sieveking: Absolute primality of polynomials is decidable in random polynomial time in the number of the variables, 8th International Colloquium on Automata, Languages and Programming ICALP 81, Springer LN Comput. Sci. 115 (1981) 16-28.
30. O. Ibarra, H. Moran: Probabilistic algorithms for deciding equivalence of straight-line programs, J. ACM 30, Vol. 1, 217-228.
31. E. Kaltofen: Greatest common divisors of polynomials given by straight line programs, J. ACM 35, No. 1 (1988) 234-264.
32. E. Kaltofen: Factorization of polynomials given by straight-line programs, Randomness in Computation, Advances in Computing Research 5, S. Micali, ed., JAI Press Inc., Greenwich, CT. (1989) 375-412.
33. J. Kollár: Sharp Effective NullstÚensatz, J. of A. M. S. 1 (1988) 963-975.
34. T. Krick and L. M. Pardo: A Computational Method for Diophantine Approximation, To appear in Proc. MEGA '94, Birkhāuser Progress in Mathematics.
35. T. Krick, L. M. Pardo: Une approche informatique pour approximation diophanti-enne, Comptes Rendues de I'Acad. des Sci. Paris, t. 318, Série I, no. 5, (1994) 407-412.
36. Y. N. Lakshman, D. Lazard: On the complexity of zero-dimensional algebraic systems, Effective methods in algebraic geometry (Castiglioncello, 1990), Prog. Math., vol. 94, Birkhāuser Boston (1991) 217-225.
37. D. Lazard: Resolution des systèmes d'équations algébriques, Theor. Comp. Sci. 15 (1981) 77-110.
38. F. S. Macaulay: The Algebraic Theory of Modular Systems, Cambridge University Press (1916).
39. M. Moeller: Systems of algebraic equations solved by means of endomorphisms, in Proc. 10th International Conference Applied Algebra, Algebraic Algorithms and Error-Correcting Codes AAECC-10, Puerto Rico 1993, G. Cohen, T. Mora and O. Moreno, eds., Springer LN Comput. Sci.
40. J. L. Montana and L. M. Pardo: Lower Bounds for Arithmetic Networks, AAECC, vol. 4 (1993), 1-24.
41. L. M. Pardo: How lower and upper complexity bounds meet in elimination theory, in this volume.
42. P. Philippon: Dénominateurs dans le théorème des zeros de Hilbert, Acta. Arith. 58 (1991) 1-25.
43. J. Sabia and P. Solernó: Bounds for traces in complete intersections and degrees in the Nullstellensatz, To appear in AAECC Journal (1993).
44. J. T. Schwartz: Fast probabilistic algorithms for verification of polynomial identities, J. ACM 27 (1980) 701-717.
45. M. Shub, S. Smale: Complexity of Bézout's theorem V: Polynomial time, Theoretical Comp. Sci. 133 (1994) 141-164.
46. M. Shub, S. Smale: On the intractability of Hilbert's Nullstellensatz and an algebraic version of NP φ PI, IBM Research Report, Yorktown Heights (1994).
47. V. Strassen: Algebraic Complexity Theory, Handbook of Theoretical Computer Science, ch. 11 (1990) 634-671.
48. V. Strassen: Vermeidung von Divisionen, Crelle J. Reine Angew. Math. 264 (1973) 184-202.
49. R. E. Zippel: Probabilistic Algorithms for Sparse Polynomials, LNCS, Vol 72 (1979) 216-226.