Lower bounds for diophantine approximations

Journal of Pure and Applied Algebra

Volumn 117-118, Issue , 1997, Pages 277-317

  Giusti, M ^a   Heintz, J ^b   Hagele K ^b   Morais, J E ^b   Pardo, L M ^b   Montana J L ^c  

^a ECOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF CANTABRIA   (Spain)

^c PUBLIC UNIVERSITY OF NAVARRE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031142051     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-4049(97)00015-7     Document Type: Article

References (59)

1. M.E. Alonso, E. Becker, M.-F, Roy and T. Wörmann, Zeroes, multiplicities and idempotents for zerodimensional systems, in: L. González and T. Recio, eds., Algorithms in Algebraic Geometry and Applications, Progress in Mathematics, Vol. 142 (Birkhäuser, Basel, 1996) 1-15.
2. E. Becker, J.P. Cardinal, M.-F. Roy and Z. Szafraniec, Multivariate Bezoutians, Kronecker symhol and Eisenbud-Levine formula, in: L. González and T. Recio, Eds., Algorithms in Algebraic Geometry and Applications, Progress in Mathematics, Vol. 142 (Birkhäuser, Basel, 1996) 79-104.
3. n], Acta Math. 166 (1991) 69-120.
4. C. Berenstein and A. Yger, Une formule de Jacobi et ses conséquences, Ann Sci. E.N.S., 4ième série 24 (1991) 363-377.
5. C. Berenstein and A. Yger, Green currents and analytic continuation, preprint, Univ. of Maryland, 1995.
6. S.J. Berkowitz, On computing the determinant in small parallel time using a small number of processors, Inf. Proc. Lett. 18 (1984) 147-150.
7. A. Borodin, J. von zur Gathen and J. Hopcroft, Fast parallel matrix and GCD computations, Inform. and Control 52 (1982) 241-256
8. J.-B. Bost, H. Gillet and C. Soulé, Un analogue arithmétique du théorème de Bézout, C.R. Acad. Sci. Paris, Série I, Math. 312 (1991) 845-848.
9. J.-B. Bost, H. Gillet and C. Soulé, Heights of projective varieties and positive Green forms, manuscript IHES, 1993.
10. D.W. Brownawell, Bounds for the degree in the Nullstellensatz, Ann. Math. 126 (1987) 577-591.
11. J.F. Canny and I.Z. Emiris, Efficient incremental algorithms for the sparse resultant and the mixed volume, preprint, 1995.
12. 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érie I, Math. 307 (1988) 255-258.
13. 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 (1989) 131-152.
14. J.P. Cardinal, Dualité et algorithmes itératives pour la solution des systèmes polynomiaux, Thèse, U. de Rennes I, 1993.
15. A.L. Chistov and D.J. Grigor'ev, Subexponential time solving systems of algebraic equations, LOMI preprints E-9-83, E-10-83, Leningrad, 1983.
16. L. Csanky, Fast parallel matrix inversion algorithms, SIAM J. Comp. 5 (1976) 618-623.
17. J.-P. Dedieu, Estimations for the separation number of a polynomial system, preprint, Univ. Paul Sabatier, Toulouse, 1995.
18. J.-P. Dedieu, Approximate solutions of numerical problems, condition number analysis and condition number theorems, preprint, Univ. Paul Sabatier, Toulouse, 1995.
19. M. Elkadi, Bornes pour le degré et les hauteurs dans le problème de division, Michigan Math. J. 40 (1993) 609-618.
20. I.Z. Emiris, On the complexity of sparse elimination, Report No. UCB/CSD-94/840, Univ. of California, 1994.
21. G. Fallings, Diophantine approximation on abelian varieties, Ann. Math. 133 (1991) 549-576.
22. 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.
23. P. Gianni and T. Mora, Algebraic solution of systems of polynomial equations using Gröbner bases, in: Proc. AAECC-5, LNCS, Vol. 356 (Springer, Berlin, 1989) 247-257.
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. M. Giusti, J. Heintz, J.E. Morais, J. Morgenstern and L.M. Pardo, Straight-line programs in geometric elimination theory, J. Pure Appl. Algebra, to appear.
26. 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.
27. M. Giusti, J. Heintz and J. Sabia, On the efficiency of effective Nullstellensätze, Comput. Complexity 3 (1993) 56-95.
28. J. Heintz, Fast quantifier elimination over algebraically closed fields, Theoret. Comput. Sci. 24 (1983) 239-277.
29. J. Heintz, T. Krick, A. Slissenko and P. Solernó, Searching for a shortest path surrounding semi- algebraic obstacles in the plane (in russian): Teorija sloznosti vyčislenij, 5, Zapiski naučnyh seminarov LOMI (Leningrad branch of the Mathematical Institute Steklov), Nauka, Leningrad, Vol. 192 (1991) 163-173.
30. n, preprint, Univ. de Limoges, 1992.
31. J. Heintz and J. Morgenstern, On the intrinsic complexity of elimination theory, J. Complexity 9 (1993) 471-498.
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. 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. J. Kollár, Sharp Effective Nullstellensatz, J. Amer. Math. Soc. 1 (1988) 963-975.
35. T. Krick and L.M. Pardo, A computational method for diophantine approximation, in: L. González and T. Recio, eds., Algorithms in Algebraic Geometry and Applications, Progress in Mathematics, Vol. 142 (Birkhäuser, Basel, 1996) 193-254.
36. T. Krick and L.M. Pardo, Une approche informatique pour l'approximation diophantienne, C.R. Acad. Sci. Paris, t. 318, Série I (5) (1994) 407-412.
37. T. Krick, J. Sabia and P. Solernó, On intrinsic bounds in the Nullstellensatz, Appl. Algebra Eng. Commun. Comput. (AAECC J.) 8 (1997) 125-134.
38. E. Kunz, Kähler Differentials, Advanced Lectures in Mathematics (Vieweg Verlag, Braunschweig/Wiesbaden, 1986).
39. B. Iversen, Generic Local Structure of the Morphisms in Commutative Algebra, Lecture Notes in Computer Science, Vol. 310 (Springer, Berlin, 1973).
40. M. Mignotte, Mathématiques pour le Calcul Formel (Presses Universitaires de France, 1989).
41. J.L. Montaña, J.E. Morais and L.M. Pardo, Lower bounds for arithmetic networks II: sum of Betti numbers, Appl. Algebra Eng. Commun. Comput. (AAECC J.) 7 (1) (1996) 41-51.
42. J.L. Montaña and L.M. Pardo, Lower bounds for arithmetic networks, Appl. Algebra Eng. Commun. Comput. (AAECC J.) 4 (1993) 1-24.
43. Yu.V. Nesterenko, Estimates for the order of zero o functions of a certain class and applications in the theory of transcendental numbers. Math. USSR Izvestija 11 (2) (1977) 239-270.
44. Yu.V. Nesterenko, On a measure of the algebraic independence of the values of certain functions. Math. USSR Sbornik 56 (1987) 545-567.
45. L.M. Pardo, How lower and upper complexity bounds meet in elimination theory, 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) 33-69.
46. P. Philippon, Critères pour l'independence algébrique, Pub. Math. de l'IHFS 64 (1987) 5-52.
47. P. Philippon, Sur des hauteurs alternatives, I, Math. Ann. 289 (1991) 255-283.
48. P. Philippon, Sur des hauteurs alternatives, II, Ann. Inst. Fourier, Grenoble, 44 (2) (1994) 1043-1065.
49. P. Philippon, Sur des hauteurs alternatives, III, J. Math. Pures Appl. 74 (1995) 345-365.
50. J. Sabia and P, Solernó, Bounds for traces in complete intersections and degrees in the Nullstellensatz, Appl. Algebra in Eng. Commun. Comput. (AAECC J.) 6 (1996) 353-376.
51. T. Schneider, Einführung in die Theorie der transzendenten Funktionen (Springer, Berlin, 1957).
52. M. Shub and S. Smale, Complexity of Bezout's theorem I: Geometric aspects, J. Amer. Math. Soc. 6 (1993) 459-501.
53. M. Shub and S. Smale, Complexity of Bezout's theorem II: Volumes and probabilities, in: F. Eyssette and A. Galligo, eds., Computational Algebraic Geometry, Progress in Mathematics, Vol. 109 (Birkhäuser, Basel, 1993) 267-285.
54. M. Shub and S. Smale, Complexity of Bezout's theorem III: condition number and packing, J. Complexity 9 (1993) 4-14.
55. M. Shub and S. Smale, Complexity of Bezout's theorem V: polynomial time, Theoret. Comput. Sci. 133 (1994).
56. M. Shub and S. Smale, On the intractability of Hubert's Nullstellensatz and an algebraic version of NP ≠ P?, IBM Research Report, Yorktown Heights (1994).
57. M. Shub and S. Smale, Complexity of Bezout's theorem IV: probability of success, extensions, SIAM J. Numer. Anal., to appear.
58. C. Soulé, Personal communication.
59. V. Strassen, Vermeidung von Divisionen, Crelle J. Reine Angew. Math. 264 (1973) 184-202.