An improved algorithmic construction of Gröbner-bases for polynomial ideals

DOI10.1145/1088261.1088267MaRDI QIDQ3208083zbMATH OpenOpenAlexFDO

Authors C. Kollreider, Bruno Buchberger

Publication date 1978

Published in ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1088261.1088267

zbMATH Keywords

algorithmic constructioncommutative ringscomputational complexityGröbner-bases of polynomial ideals

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Ideals and multiplicative ideal theory in commutative rings (13A15) Analysis of algorithms and problem complexity (68Q25)

Cited in

(5)

• New constructive methods in classical ideal theory
• History and basic features of the critical-pair/completion procedure
• A survey on signature-based algorithms for computing Gröbner bases
• Tangent complexes and the Diamond Lemma
• msolve. A library for solving polynomial systems

This page was built for publication: An improved algorithmic construction of Gröbner-bases for polynomial ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3208083)