This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D. Bayer. A generalisation of row reduction and the euclidean algorithm. Preprint, Harvard University.
N. Bourbaki. Algèbre commutative. Hermann (Paris)
B. Buchberger. A criterion for detecting unneccessary reductions in the constructions of Gröbner bases. In EUROSAM'79, Lect. Notes in Computer Sc. 72 (Springer, Berlin, 1979), p. 3–21.
F. Chaoui. To appear.
J.H. Davenport. The computerization of algebraic geometry. In EUROCAM'79, p. 119–133.
J.H. Davenport. Integration of algebraic functions. In EUROCAM'79, p. 415–425.
J.H. Davenport. On the integration of algebraic functions. Lect. Notes in Computer Sc. no 102 (Springer, 1981)
G. Herman. Die Frage der endlich vielen Schritte in der Theorie der Polynomideale, Math. Ann. 95 (1926), p. 736–788.
G. Havas, L. Sterling. Integer matrices and abelian groups. In EUROCAM'79, p. 431–451.
J. Heintz, M. Sieveking. Absolute primality of polynomials is decidable in random polynomial time in the number of variables.
I. Kaplanski. Commutative rings. Allyn and Bacon (Boston, 1970)
R. Kannan,A. Bachen. Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. Siam J. Comput, 8 (1979), p. 499–507.
D. Lazard. Elimination non linéaire. In Symbolic computational methods and applications (St Maximin, 1977), p. 284–286.
D. Lazard. Algèbre linéaire sur k[X1,...,Xn] et élimination. Bull. Soc. Math. France 105 (1977), p. 165–190.
D. Lazard. Systems of algebraic equations. In EUROCAM'79, p. 88–94.
D. Lazard. Résolution des systèmes d'équations algébriques. Theor. Comp. Sciences 15 (1981), p. 77–110.
F. Mora. An algorithm to compute standard bases. These proceedings.
F. Richman. Constructive aspects of noetherian rings. Proc. Amer. Math. Soc. 44 (1974), p. 436–441.
P. Samuel, O. Zariski. Commutative algebra. Van Nostrand (Princeton, 1958).
A. Seidenberg. Constructions in algebra. Trans. Amer. Math. Soc. 197 (1974), p. 273–313.
A. Seidenberg. Constructions in a polynomial ring over the ring of integers. American J. of Math. 100, p. 685–703.
A. Seidenberg. Construction of the integral closure of a finite integral domain. Rend. Sem. Math. Fis. Milano, 40 (1970), p. 101–120.
A. Seidenberg. Construction of the integral closure of a finite integral domain II. Proc. Amer. Math. Soc. 52 (1975), p. 368–372.
A. Seidenberg. On the impossibility of some constructions in polynomial rings. Atti Convegni Lincei 1973, p. 77–85.
G. Stolzenberg. Constructive normalization of an algebraic variety. Bull. Amer. Math. Soc. 74 (1968), p. 595–599.
E. Tournier. An algebraic form of a solution of a system of linear equations with constant coefficients. In EUROCAM'79, p. 153–163.
Y.Y. Yun. On algorithms for solving systems of polynomial equations. ACM SIGSAM Bull. 27 (1973), p. 19–25.
A. Fröhlich, J.C. Shepherdson. Effective procedures in field theory. Philos. Trans. roy. Soc. London, Ser. A, 248 (1955) p. 407–432.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lazard, D. (1982). Commutative algebra and computer algebra. In: Calmet, J. (eds) Computer Algebra. EUROCAM 1982. Lecture Notes in Computer Science, vol 144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11607-9_5
Download citation
DOI: https://doi.org/10.1007/3-540-11607-9_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11607-3
Online ISBN: 978-3-540-39433-4
eBook Packages: Springer Book Archive