Algorithms for computing Gröbner bases of polynomial ideals over various Euclidean rings
- 1 December 2005
- book chapter
- Published by Springer Nature
- p. 195-206
- https://doi.org/10.1007/bfb0032842
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Algebraic SimplificationPublished by Springer Nature ,1982
- A simplified proof of the characterization theorem for Gröbner-basesACM SIGSAM Bulletin, 1980
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Canonical representatives for residue classes of a polynomial idealPublished by Association for Computing Machinery (ACM) ,1976
- Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.Published by Elsevier ,1970
- A Canonical Basis for the Ideals of a Polynomial DomainThe American Mathematical Monthly, 1952