A simplified proof of the characterization theorem for Gröbner-bases
From MaRDI portal
Publication:3902472
DOI10.1145/1089235.1089238zbMath0454.68021OpenAlexW2007581493MaRDI QIDQ3902472
Bruno Buchberger, Leo Bachmair
Publication date: 1980
Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1089235.1089238
Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Ideals and multiplicative ideal theory in commutative rings (13A15)
Related Items
New constructive methods in classical ideal theory, History and basic features of the critical-pair/completion procedure, Computing a Gröbner basis of a polynomial ideal over a Euclidean domain, A new notion of reduction: Generating universal Gröbner bases of ideals in \(K[x,y\)], Notes on Gröbner bases, Deductive and inductive synthesis of equational programs
