@incollection{AST_1976__38-39__131_0, author = {Lazard, Daniel}, title = {Algorithmes fondamentaux en alg\`ebre commutative}, booktitle = {Journ\'ees algorithmiques}, series = {Ast\'erisque}, pages = {131--138}, publisher = {Soci\'et\'e math\'ematique de France}, number = {38-39}, year = {1976}, mrnumber = {439831}, zbl = {0353.13002}, language = {fr}, url = {http://archive.numdam.org/item/AST_1976__38-39__131_0/} }
TY - CHAP AU - Lazard, Daniel TI - Algorithmes fondamentaux en algèbre commutative BT - Journées algorithmiques AU - Collectif T3 - Astérisque PY - 1976 SP - 131 EP - 138 IS - 38-39 PB - Société mathématique de France UR - http://archive.numdam.org/item/AST_1976__38-39__131_0/ LA - fr ID - AST_1976__38-39__131_0 ER -
Lazard, Daniel. Algorithmes fondamentaux en algèbre commutative, dans Journées algorithmiques, Astérisque, no. 38-39 (1976), pp. 131-138. http://archive.numdam.org/item/AST_1976__38-39__131_0/
[C] The SAC-1 polynomial greatest common divisor and resultant system Computer. Sci. Dep. Tech. Rep. 145, U of Winconsin(72)
:[H] Die Frage der endlich vielen Schritte in der theorie der Polynomideale, Math. Ann. 95 (1926), 736-788. | DOI | EuDML | JFM | MR
:[L] Algèbre linéaire sur les anneaux de polynômes. Cahiers de Math. N°3 (1974) Univ. de Montpellier. | MR
:Équations linéaires sur les anneaux de polynômes. Comptes- Rendus du colloque de Limoges (1975). A paraître.
:[MC] The exact solution of systems of linear equations with polynomial coefficients. J. of A.C.M. 20 (1973) 563-588. | MR | Zbl
:[MU] Multivariate polynomial factorisation. J. of A.C.M. 22 (1975) 291-308. | MR | Zbl
:[S] Construction in Algebra. Trans. Amer. Math. Soc. 197 (1974) 273-313. | DOI | MR | Zbl
:[V d W] Moderne Algebra, vol. 1, 2ème ed. Springer, Berlin 1937; ou trad. Angl. Ungar, New-York (1949).
: