Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations

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

Volumn 162 LNCS, Issue , 1983, Pages 146-156

  Lazard, D ^a  

^a UNIVERSITÉ DE POITIERS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85034440461     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-12868-9_99     Document Type: Conference Paper

References (12)

1. D.A. Bayer. The division algorithm and the Hilbert scheme, PhD, Harward Univ., 1982.
2. B. Buchberger. Ein algorithmishes Kriterium fur die Lösbarkeit eines algebraischen Gleischungsystem. Aequationes Matematicea 4 (1970), p. 374-383.
3. B. Buchberger. A criterion for detecting unnecessary reductions in the construction of Gröbner bases, EUROSAM’79, Leet. Notes in Comp. Sc. n°72 (1979), p. 3-21.
4. B. Buchberger. A note on the complexity of constructing Grabner bases. These proceedings.
5. I. Kaplansky. Commutative rings. Allyn and Bacon (Boston, 1970)
6. D. Lazard. Algèbre linéaire sur K[X1, …, Xn] et élimination. Bull. Soc. Math. France 105 (1977), p. 165-190.
7. D. Lazard. Systems of algebraic equations. EUROSAM 7z9, p. 88-94.
8. D. Lazard. Résolution des systèmes d’équations algébriques. Theor. Comp. Sciences 15 (1981), p. 77-110.
9. D. Lazard. Commutative Algebra and Computer Algebra, EUROCAM’82, Leet. Notes in Comp. Sc. n° 144 (1982), p. 40-48.
10. F. Mora. An algorithm to compute the equations of tangent cones, EUROCAM’82, p. 158-165.
11. M. Pohst, D.Y.Y. Yun. On solving systems of algebraic equations via ideal bases and elimination theory SYMSAC 1981, p. 206-211.
12. W. Trinks, Ueber B. Buchberger Verfahren, Systeme algebraischer Gleischungen zu lösen, J. Of Number Theory 10 (1978), p. 475-488.