An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs

Journal of Pure and Applied Algebra

Volumn 129, Issue 2, 1998, Pages 173-200

  Puddu, Susana ^a   Sabia, Juan ^a  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032479656     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-4049(97)00068-6     Document Type: Article

References (42)

1. [1] F. Amoroso, Tests d'appartenance d'après un théorème de Kollár, Acad. Sci. Paris, Serie I Math. 309 (1989) 691-694.
2. [2] J.L. Balcázar, J. Díaz, J. Gabarró, Structural Complexity I, EATCS Monographs on Theoretical Computer Science, vol. 11, Springer, Berlin, 1988.
3. n], Acta Math. 166 (1991) 69-120.
4. [4] S.J. Berkowitz, On computing the determinant in small parallel time using a small number of processors, Inform. Process. Lett. 18 (1984) 147-150.
5. [5] A. Borodin, On relating time and space to size and depth, SIAM J. Comput. 6 (1977) 733-744.
6. [6] A. Borodin, J. von zur Gathen, J. Hopcroft, Fast parallel matrix and gcd computations, Proc. 23rd Annual Symp. FOCS, 1982, pp. 65-71.
7. [7] D. Brownawell, Bounds for the degrees in the Nullstellensatz, Ann. Math. 2nd Series, 126 (3) (1987) 577-591.
8. [8] D. Brownawell, A prime power version of Nullstellensatz, Manuscript, 1989.
9. [9] L. Caniglia, Complejidad de algoritmos en geometría computacional, Thesis, Universidad de Buenos Aires, 1989.
10. [10] L. Caniglia, How to compute the Chow Form of an unmixed polynomial ideal in single exponential time, AAECC, Springer, Berlin, 1990.
11. [11] L. Caniglia, A. Galligo, J. Heintz, Borne simple 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 t. 307, Serie I (1988) 255-258.
12. [12] L. Caniglia, A. Galligo, J. Heintz, Some new effective bounds in computational geometry, Proc. 6th Internat. Conf. Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Rome 1988, Lecture Notes in Computer Science, vol. 357, Springer, Berlin, 1989, pp. 131-151.
13. [13] L. Caniglia, J. Guccione, J.J. Guccione, Local membership problems for polynomial ideals, in: T. Mora, C. Traverso (Eds.), Proc. Internat. Conf. Effective Methods in Algebraic Geometry MEGA 90, Castiglioncello 1990, Progress in Mathematics, vol. 94, Birkhäuser, Basel, 1991, pp. 31-45.
14. [14] A.L. Chistov, D. Yu. Grigor'ev, Subexponential time solving systems of algebraic equations I, II, LOMI Preprints E-9-83, E-10-83, Leningrad, 1983.
15. [15] A.L. Chistov, D. Yu. Grigor'ev, Complexity of quantifier elimination in the theory of algebraically closed fields, Proc. 11th Symp. MFCS 1984, Lecture Notes in Computer Science, vol. 176, Springer, Berlin, 1984, pp. 17-31.
16. [16] N. Fitchas, A. Galligo, J. Morgenstern, Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields, J. Pure Appl. Algebra 67 (1990) 1-14.
17. [17] N. Fitchas, M. Giusti, F. Smietanski, Sur le complexité du théorème des zéros, in: B. Brosowski, F. Deutsch, J. Gudatt (Eds.), Approximation and Optimization in the Caribbean II, Proc. 2nd Internat. Conf. on Approximation and Optimization, La Habana, 1993, Peter Lang, 1995, pp. 274-329.
18. [18] M. Giusti, 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. Eiseinbud, L. Robbiano (Eds.), Proc. Cortona Conf. on Computational Algebraic Geometry and Commutative Algebra, Symposia Matematica, Vol. XXXIV, Istituto Nazionale di Alta Matematica, Cambridge University Press, Cambridge, 1993.
19. [19] M. Giusti, J. Heintz, J. Sabia, On the efficiency of effective Nullstellensätze, Comput. Complexity 3 (1993) 56-95.
20. [20] M. Giusti, J. Heintz, J.E. Morais, J. Morgenstern, L.M. Pardo, Straight line programs in geometric elimination theory, Manuscript, 1995.
21. [21] D. Yu. Grigor'ev, The complexity of the decision for the first order theory of algebraically closed fields, Math. USRR Izvestija 29 (2) (1987) 459-475.
22. [22] J. Heintz, Definability and fast quantifier elimination over algebraically closed fields, Theoret. Comput. Sci. 24 (1983) 239-277.
23. [23] J. Heintz, On the computational complexity of polynomials and bilinear mappings, a survey, in: L. Huguet, 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, pp. 269-300.
24. [24] J. Heintz, C.P. Schnorr, Testing polynomials which are easy to compute, Monographie de l'Enseignement Mathematique, vol. 30, Impr. Kundig, Geneve, 1982, pp. 237-254.
25. [25] J. Heintz, M. Sieveking, Absolute primality of polynomials is decidable in random polynomial time in the number of the variables, 8th Internat. Colloquium on Automata, Languages and Programming ICALP 81, Lecture Notes in Computer Science, vol. 115, Springer, Berlin, 1981.
26. [26] J. Heintz, R. Wüthrich, An efficient quantifier elimination algorithm for algebraically closed fields, SIGSAM Bull. 9 (1975) 11.
27. [27] D. Ierardi, Quantifier elimination in the theory of an algebraically-closed field, J. ACM (1989) 138-147.
28. [28] E. Kaltofen, Greatest common divisors of polynomials given by straight line programs, J. ACM 35 (1) (1988) 231-264.
29. [29] J. Kollar, Sharp effective Nullstellensatz, J. AMS 1 (1988) 963-975.
30. [30] T. Krick, Complejidad para problemas de geometria elemental, Thesis, Universidad de Buenos Aires, 1990.
31. [31] T. Krick, L.M. Pardo, A computational method for diofantine approximation, Proc. MEGA'94, Progress in Mathematics, Birkhäuser, Basel, 1994.
32. [32] G. Matera, J.M. Turull, The space complexity of elimination: upper bounds, Manuscript, 1995.
33. [33] K. Mulmuley, A fast parallel algorithm to compute the rank of a matrix over an arbitrary field, Proc. 18th ACM Symp. Theory of Computing, 1986, pp. 338-339.
34. [34] Yu. V. Nesterenko, Estimates for the orders of zeros of functions of a certain class and applications in the theory of trascendental numbers, Math. USSR Izvestija, 11 (2) (1977) Izvestia Akad. Nauk. SSR Set-Mat. Tom 41 (2) (1977).
35. [34] Yu. V. Nesterenko, Estimates for the orders of zeros of functions of a certain class and applications in the theory of trascendental numbers, Math. USSR Izvestija, 11 (2) (1977) Izvestia Akad. Nauk. SSR Set-Mat. Tom 41 (2) (1977).
36. [35] P. Philippen, Théorème des zéros effectif d' après J. Kollár, Seminaire I.H.P. (1988).
37. [36] J. Renegar, On the computational complexity and geometry of the first-order theory of the reals, J. Symbol. Comput. 13 (1992) 253-352.
38. [37] H.J. Stoss, On the representation of rational functions of bounded complexity, Theoret. Comput. Sci. 64 (1989) 1-13.
39. [38] V. Strassen, Berechnung und Programm I, Acta Inform. 1 (1972) 320-334.
40. [39] A. Tarski, A Decision Method for Elementary Algebra and Geometry, 2nd ed., Univ. of California Press, Berkeley, CA, 1951.
41. [40] J. von zur Gathen, Parallel arithmetic computations: a survey, Proc. 13th Symp. MFCS 1986, Lecture Notes in Computer Science, vol. 233, Springer, Berlin, 1986, pp. 93-112.
42. [41] R. Wüthrich, Ein Quantoreneliminationverfahren für die Theorie der algebraisch abgeschlossenen Körper, Ph.D. Thesis, University of Zurich, 1977.