Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- 1 August 1988
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 6 (1) , 37-57
- https://doi.org/10.1016/s0747-7171(88)80020-8
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- New constructive methods in classical Ideal theoryJournal of Algebra, 1986
- The Knuth-Bendix Completion Procedure and Thue SystemsSIAM Journal on Computing, 1985
- On constructing bases for ideals in polynomial rings over the integersJournal of Number Theory, 1983
- About the rewriting systems produced by the Knuth-Bendix completion algorithmInformation Processing Letters, 1983
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Über B. Buchbergers verfahren, systeme algebraischer gleichungen zu lösenJournal of Number Theory, 1978
- Constructive aspects of Noetherian ringsProceedings of the American Mathematical Society, 1974
- A Canonical Basis for the Ideals of a Polynomial DomainThe American Mathematical Monthly, 1952
- Quadratic fields with and without Euclid's algorithmMathematische Annalen, 1934