Sur la complexité du calcul des projections d'une courbe projective

Communications in Algebra

Volumn 27, Issue 7, 1999, Pages 3211-3220

  Bermejo, Isabel ^a   Lejeune Jalabert, Monique ^b  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

^b INSTITUT FOURIER   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033244743     PISSN: 00927872     EISSN: None     Source Type: Journal    
DOI: 10.1080/00927879908826623     Document Type: Article

References (10)

1. Bayer D.; The division algorithm and the Hilbert scheme, Ph.D. Thesis Harvard University, 1982.
2. Bayer D. et Mumford D.; What can be computed in Algebraic Geometry?, in Computational Algebraic Geometry and Commutative Algebra, Proceedings Cortona 1991 (D. Eisenbud and L. Robbiano, Eds.), Cambridge University Press, 1993, 1-48.
3. Bayer D. et Stillman M.; A criterion for detecting m-regularity, Invent. Math. 87, 1987, 1-11.
4. Bayer D. et Stillman M.; A theorem on refining division orders by the reverse lexicographic order, Duke Math. Journal 55 (2), 1987, 321-328.
5. Bermejo I.; Sur les degrés d'une base standard minimale pour l'ordre lexicographique d'un idéal dont la variété des zéros est Cohen-Macaulay de dimension 1, C.R. Acad. Sci. Paris Série I Math. 310, 1990, 591-594.
6. Bourbaki N.; Algèbre Commutative, Ch. 8, Masson, 1985.
7. Gruson L., Lazarsfeld R. et Peskine C.; On a theorem of Castelnuovo, and the equations defining space curves, Invent. Math. 72, 1983, 491-506.
8. Lejeune-Jalabert M.; Effectivité de calculs polynomiaux, Cours de D.E.A., Grenoble, 1984-85.
9. Möller H. et Mora F.; Upper and lower bounds for the degree of Gröbner bases, Proc. EUROSAM 84, Lecture Notes in Computer Science 174, 1984.
10. Sturmfels B.; Gröbner bases and convex polytopes, AMS University Series 8, Providence, 1996.