Systems of rational polynomial equations have polynomial size approximate zeros on the average

Journal of Complexity

Volumn 19, Issue 2, 2003, Pages 161-209

  Castro, D ^a   Pardo, L M ^b   San Martin J ^b  

^a ECOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF CANTABRIA   (Spain)

Author keywords

Approximate zeros; Discrepancy bounds; Height of projective points; Probability and uniform distribution; Semi algebraic sets

Indexed keywords

EID: 0037389396     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0885-064X(02)00028-6     Document Type: Article

References (55)

1. B. Bank, M. Giusti, J. Heintz, G.M. Mbakop, Polar varieties, real equation solving, and data structures: the hypersurface case, J. Complexity 13 (1997) 5-27.
2. B. Bank, M. Giusti, J. Heintz, G.M. Mbakop, Polar varieties and efficient real elimination, Math. Z. 238 (2001) 115-144.
3. S. Basu, R. Pollack, M.F. Roy, On the combinatorial and algebraic complexity of quantifier elimination, J. ACM 43 (1996) 1002-1045.
4. R. Benedetti, J.J. Risler, Real Algebraic and Semi-algebraic Sets, Hermann, Paris, 1990.
5. L. Blum, F. Cucker, M. Shub, S. Smale, Complexity and Real Computation, Springer, New York, 1998.
6. J. Bochnak, M. Coste, M.-F. Roy, Géométrie Algébrique Réelle, Ergebnisse der Math., 3. Folge, Band 12, Springer, Berlin, 1987.
7. W.S. Brown, On Euclid's algorithm and the computation of polynomial greatest common divisors, J. ACM 18 (1971) 478-504.
8. W.S. Brown, The subresultant PSR algorithm, ACM Trans. Math. Software 4 (1978) 237-249.
9. W.S. Brown, J.F. Traub, On Euclid's algorithm and the theory of subresultants, J. ACM 18 (1971) 505-514.
10. D. Castro, M. Giusti, J. Heintz, G. Matera, L.M. Pardo, On the hardness of polynomial equation solving, Found. Comput. Math (2003), submitted.
11. D. Castro, K. Hägele, J.E. Morais, L.M. Pardo, Kronecker's and Newton's approaches to solving: a first comparison, J. Complexity 17 (2001) 212-303.
12. D. Castro, J.L. Montaña, L.M. Pardo, J. San Martín, The distribution of condition numbers of rational data of bounded bit length, Found. Comput. Math. 1 (1) (2002) 1-52.
13. K.K.S. Choi, On the distribution of points in projective space of bounded height, Trans. Amer. Math. Soc. 352 (2000) 1071-1111.
14. G.E. Collins, Subresultants and reduced polynomial remainder sequence, J. ACM 14 (1967) 128-142.
15. H. Davenport, On a principle of Lipschitz, J. London Math. Soc. 26 (1951) 179-183.
16. P. Erdös, P. Turán, On a problem in the theory of uniform distribution. I, Indagagtiones. Math. 10 (1948) 370-378.
17. P. Erdös, P. Turán, On a problem in the theory of uniform distribution. II, Indag. Math. 10 (1948) 406-413.
18. M. Giusti, J. Heintz, La Détermination des Points Isolés et de la Dimension d'une Varieté Algébrique Peut se Faire en Temps Polynomial, in: D. Eisenbud, L. Robbiano (Eds.), Computational Algebraic Geometry and Commutative Algebra, Proceedings of the Cortona Conference on Computational Algebraic Geometry and Commutative Algebra, Symposia Matematica, Vol. XXXIV, Cambridge University Press, Cambridge, 1993, pp. 216-256.
19. M. Giusti, K. Hägele, J. Heintz, J.E. Morais, J.L. Montaña, L.M. Pardo, Lower bounds for diophantine approximations, J. Pure Appl. Algebra 117 & 118 (1997) 277-317.
20. M. Giusti, J. Heintz, J.E. Morais, L.M. Pardo, When polynomial equation systems can be "Solved" fast?, in: G. Cohen, M. Giusti, T. Mora (Eds.), Proceedings of the 11th International Symposium Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-11, Paris, Lecture Notes in Computer Science, Vol. 948, Springer, Berlin, 1995, pp. 205-231.
21. 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 Série I 325 (1997) 1223-1228.
22. 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.
23. M. Giusti, G. Lecerf, B. Salvy, A Gröbner free alternative for polynomial system solving, J. Complexity 17 (2001) 154-211.
24. W. Habicht, Eine Verallgemeirung des Sturmschen Wurzelzählverfahrens, Comment. Math. Helv. 21 (1948) 99-116.
25. K. Hägele, J.E. Morais, L.M. Pardo, M. Sombra, On the intrinsic complexity of the arithmetic nullstellensatz, J. Pure Appl. Algebra 146 (2) (2000) 103-183.
26. G.H. Hardy, E.M. Wright, An Introduction to the Theory of Numbers, Clarendon Press, Oxford, 1938.
27. J. Heintz, Definability and fast quantifier elimination in algebraically closed fields, Theor. Comput. Sci. 24 (1983) 239-277.
28. J. Heintz, G. Matera, Luis M. Pardo, R. Wachenchauzer, The intrinsic complexity of parametric elimination methods, Electron. J. SADIO 1 (1) (1998) 37-51.
29. J. Heintz, G. Matera, A. Waissbein, On the time-space complexity of geometric elimination procedures, Appl. Algebra Eng. Commun. Comput. 11 (2001) 239-296.
30. J. Heintz, C.P. Schnorr, Testing polynomials which are easy to compute, in: Logic and Algorithmic (an International Symposium in Honour of Ernst Specker), Monographie n. 30 de l'Enseignement Mathématique, 1982, pp. 237-254 (A preliminary version appeared in Proceedings of the 12th Annual ACM Symposium on Computing, 1980, pp. 262-268).
31. P. Koiran, Approximating the volume of definable sets, in: 36th Annual IEEE Symposium FOCS, 1995, pp. 134-141.
32. T. Krick, L.M. Pardo, A computational method for diophantine approximation, in: Algorithms in Algebraic Geometry and Applications, Proceedings MEGA'94, Progress in Mathematics, Vol. 143, Birkhäuser, Basel, 1996, pp. 193-254.
33. T. Krick, Luis M. Pardo, M. Sombra, Sharp estimates for the arithmetic nullstellensatz, Duke Math. J. 109 (2001) 521-598.
34. G. Lecerf, Une Alternative aux Méthodes de Réécriture pour la Résolution des Systèmes Algébriques, Ph.D. Thesis, École Polytechnique, France, 2001.
35. T. Lickteig, M.F. Roy, Sylvester-Habicht sequences and fast cauchy index computation, J. Symb. Comput. 31 (2001) 315-341.
36. S. Lojasiewicz, Ensembles Semi-Analytiques, Lecture Notes, Institut des Hautes Etudes Scientiques, Presses Universitaires de France, 1966.
37. R. Loos, Generalised polynomial remainder sequences, in: B. Buchberger, G.E. Collins, R. Loos, R. Albrecht (Eds.), Computer Algebra, Symbolic and Algebraic Computation, Springer, Berlin, 1982.
38. J. Milnor, On the Betti numbers of real varieties, Proc. Amer. Math. Soc. 15 (1964) 275-280.
39. J.L. Montaña, L.M. Pardo, Lower bounds for arithmetic networks, Appl. Algebra Eng. Commun. Comput. 4 (1993) 1-24.
40. L.J. Mordell, On some arithmetical results in the geometry of numbers, Compositio Math. 1 (1934) 248-253.
41. O.A. Oleinik, Estimates of the Betti numbers of real algebraic hypersurfaces, Mat. Sbornik 70 (1951) 635-640.
42. O.A. Oleinik, I.B. Petrovsky, On the topology of real algebraic surfaces, Izv. Akad. Nauk SSSR (in Trans. of the Amer. Math. Soc.) 1 (1962) 399-417.
43. L.M. Pardo, How lower and upper complexity bounds meet in elimination theory, in: G. Cohen, M. Giusti, T. Mora (Eds.), Proceedings of the 11th International Symposium Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-11, Paris, Lecture Notes in Computer Science, Vol. 948, Springer, Berlin, 1995, pp. 33-69.
44. L.M. Pardo, Universal elimination requires exponential running time (Extended Abstract), in: A. Montes (Ed.), Proceedings EACA' 2000, Barcelona, 2000, pp. 25-51.
45. M.F. Roy, Basic algorithms in real algebraic geometry and their complexity: from Sturm's theorem to the existential theory of reals, in: F. Broglia (Ed.), Lecture on Real Algebraic Geometry in Memoriam of Mario Raimondo, de Gruyter Expositions in Mathematics, Vol. 23, Walter de Gruyter and Co. 1996, pp. 1-67.
46. A. Seidenberg, A new decision method for elementary algebra, Ann. Math. 60 (2) (1954) 365-374.
47. M. Shub, Some remark's on Bézout's theorem and complexity theory, in: M. Hirsch, J. Marsden, M. Shub (Eds.), From Topology to Computation: Proceedings of the Smalefest, Springer, 1993, pp. 443-455.
48. M. Shub, S. Smale, Complexity of Bézout's theorem II: volumes and probabilities, in: Proceedings MEGA' 92, Progress in Mathematics, Vol. 109, Birkhäuser, Basel, 1993, pp. 267-285.
49. M. Shub, S. Smale, Complexity of Bézout's theorem I: geometric aspects, J. Amer. Math. Soc. 6 (1993) 459-501.
50. M. Shub, S. Smale, Complexity of Bezout's theorem. IV: probability of success; extensions, SIAM J. Numer. Anal. 33 (1996) 128-148.
51. A. Tarski, A Decision Method for Elementary Algebra and Geometry, RAND Corporation, Santa Monica, CA, 1948.
52. R. Thom, Sur l'Homologie des Variétés Algébriques Réelles, in: Differential and Combinatorial Topology, A Symposium in Honor of Marston Morse, Princeton University Press, Princeton, 1965, pp. 255-265.
53. J.D. Vaaler, Some extremal functions in Fourier analysis, Bull. Amer. Math. Soc. (NS) 12 (1985) 183-216.
54. H.E. Warren, Lower bounds for approximation by non linear manifolds, Trans. AMS 133 (1968) 167-178.
55. H. Weyl, Über die Gleichverteilung von Zahlen Modulo 1, Math. Ann. 77 (1916) 313-352.