Comments on the translation of my PhD thesis

Journal of Symbolic Computation

Volumn 41, Issue 3-4, 2006, Pages 471-474

  Buchberger, Bruno ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30944448998     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2005.09.008     Document Type: Editorial

References (7)

1. Buchberger, B., 1965. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal (An algorithm for finding the basis elements of the residue class ring of a zero-dimensional polynomial ideal). Doctoral Thesis, Mathematical Institute, University of Innsbruck, December 1995
2. B. Buchberger Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems (An algorithmic criterion for the solvability of algebraic systems of equations) Aequationes Math. 4 3 1970 374-383
3. B. Buchberger A theoretical basis for the reduction of polynomials to canonical forms SIGSAM Bull. (ACM Special Interest Group on Symbolic and Algebraic Manipulation) 10 3 1976 19-29
4. Gröbner bases and applications In: B. Buchberger F. Winkler (Eds.), Proceedings of the International Conference "33 Years of Groebner Bases" 1998, RISC, Austria In: London Mathematical Society Lecture Note Series vol. 251 1998 Cambridge University Press
5. B. Buchberger Towards the automated synthesis of a Gröbner basis algorithm RACSAM (Rev. Spanish R. Acad. Sci.) 98 1 2004 65-75
6. E.L. Dickson Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors Amer. J. Math. 35 1913 413-422
7. W. Gröbner Über die Eliminationstheorie (On elimination theory) Monatsh. Math. 5 1950 71-78