Some new effectivity bounds in computational geometry

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

Volumn 357 LNCS, Issue , 1989, Pages 131-151

  Caniglia, Leandro ^a   Galligo, André ^b,c   Heintz, Joos ^a  

^a INSTITUTO ARGENTINO DE MATEMÁTICA   (Argentina)

^b UNIVERSITÉ CÔTE D'AZUR   (France)

^c INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85027644628     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-51083-4_54     Document Type: Conference Paper

References (37)

1. D. Bayer, M. Stillman: On the complexity of computing syzygies. Preprint 1985.
2. n]. Preprint University of Maryland 1987.
3. S.J. Berkowitz: On computing the determinant in small parallel time using a small number of processors. Information Processing Letters 18 (1984) 147-150.
4. J. Briançon: Sur le degré des relations entre polynômes. C.R. Acad.Sci. Paris 297, Série I (1982) 553-556.
5. D. Brownawell: Bounds for the degrees in the Nullstellensatz. Arm.math. Second Series, Vol. 126 No 3 (1987) 577-591.
6. W.D. Brownawell: Borne effective pour 1ʹexponent dans le théorème des zéros. C.R. Acad.Sci. Paris 305, Série I (1987) 287-290.
7. W.D. Brownawell: Local Diophantine Nullstellen Inequalities. Preprint Penn State University 1987.
8. B. Buchberger: Ein algorithmisches Kriterium für die Lösbarkeit eines algebra-ischen Gleichungssystems. Aequat.math. 4 (1970) 374-383.
9. B. Buchberger: A criterion for detecting unnecessary reductions in the construction of Gröbner bases. Sym. and Alg.Comp., Springer LN Comput.Sci. 72 (1979) 3-21.
10. B. Buchberger: A note on the complexity of constructing Gröbner bases. Proc. Eurocal’83, Computer Algebra, ed. J.A. van Hulzen, Springer LN Comput.Sci. 162 (1983) 137-145.
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. to appear in: C.R. Acad.Sci. Paris 1988.
12. 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.
13. A.L. Chistov, D.Yu. Grigor’ev: Complexity of quantifier elimination in the theory of algebraically closed fields. Proc. 11th Symp. MFCS 1984, Springer LN Comput.Sci. 176 (1984) 17-31.
14. A.L. Chistov: Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic. Proc. Int.Conf. FCT 1985, Springer LN Comput.Sci. 199 (1985) 63-69.
15. N. Fitchas, A. Galligo, J. Morgenstern: Algorithmes rapides en séquentiel et en parallel pour 1’élimination de quantificateurs en géométrie élémentaire. to appear in: Séminaire Structures Algébriques Ordonnées, UER de Math., Université de Paris VII (1987); final version to appear in: Same Sèminary, Publ.Univ. Paris VII.
16. A. Galligo: Algorithmes de construction de bases standards. Preprint University of Nice 1985.
17. 187 Kazan 1987.
18. M. Giusti: Some effectivity problems in polynomial ideal theory. Proc. Eurosam 84, Springer LN Comput.Sci. 174(1984) 159-171.
19. M. Giusti: Complexity of standard bases in projective dimension zero. Preprint Ecole Polytechnique Paris 1987.
20. M. Giusti: Combinatorial dimension theory of algebraic varieties. Preprint Ecole Polytechnique Paris 1988.
21. D.Yu. Grigor’ev: The complexity of the decision problem for the first order theory of algebraically closed fields. Math. USSR Izvestija, Vol. 29, No 2 (1987) 459-475.
22. J. Beintz: Definability and fast quantifier elimination in algebraically closed fields. Theoret.Comput.Sci. 24 (1983) 239-277; Russian transl.in: Kyberneticeskij Sbomik, Novaja Serija Vyp. 22, Mir Moscow (1985) 113-158.
23. J. Heintz, R. Wüthrich: An efficient quantifier elimination algorithm for algebraically closed fields. SIGSAM Bull. 9 (4) (1975) 11.
24. J. Kollár: Sharp effective Nullstellensatz. Manuscript 1988.
25. B. Iversen: Generic Local Structure in Commutative Algebra. Springer LN Math. 310 (1973).
26. J.P. Jouanolou: Théorèmes de Bertini et applications. Birkhäuser PM 42 (1983).
27. C. Kollreider, B. Buchberger: An improved algorithmic construction of Gröbner-bases for polynomial ideals. Bericht Nr. 170 (1978), Technical Report, Universität Linz.
28. n] et élimination. Bull.Soc.Math. France 105 (1977) 165-190.
29. D. Lazard: Gröbner Bases, Gaussian Elimination and Resolution of Algebraic Equations. Proc. Eurocal’83, Computer Algebra, ed. J.A. vanHulzen, Springer LN Comput.Sci. 162 (1983) 146-156.
30. H. Matsumura: Connnutative algebra. W.A. Benjamin 1980 (first edition).
31. E. Mayr, A. Meyer: The complexity of the word problem for commutative semi groups and polynomial ideals. Advances in Math. 46 (1982) 305-329.
32. H.M. Möller, F. Mora: New Constructive Methods in Classical Ideal Theory. J. of Algebra, Vol. 100, No 1 (1986) 138-178.
33. K. Mulmuley: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Proc. 18th Ann. ACM Symp. Theory of Computing (1986) 338-339.
34. I.R. Shafarevich: Algebraic Geometry. Springer Berlin 1974.
35. B. Shiffman: New degree bounds for the Nullstellensatz in arbitrary characteristic. Manuscript 1988.
36. V. Weispfenning: The complexity of linear problems in fields. J. on Symbolic Comput. Vol. 5, No 1-2 (1988) 3-27.
37. R. Wüthrich: Ein schnelles Quantoreneliminationsverfahren für die Theorie der algebraisch abgeschlossenen Körper. Ph.D.-Thesis, Univ. Zurich 1977.