An extension of buchberger's algorithm to compute all reduced gröbner bases of a polynomial ideal

DOI10.1007/3-540-51517-8_130zbMath1209.13008OpenAlexW2163713942MaRDI QIDQ5393354

Klaus-Peter Schemmel

Publication date: 16 April 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-51517-8_130

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

A combinatorial result on Gröbner fans with an application to universal Gröbner bases ⋮ A new notion of reduction: Generating universal Gröbner bases of ideals in \(K[x,y\)] ⋮ Comprehensive Gröbner bases