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

DOI10.1145/1088261.1088267zbMATH Open0417.68028OpenAlexW2007704220MaRDI QIDQ3208083FDOQ3208083

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

computational complexitycommutative ringsalgorithmic constructionGröbner-bases of polynomial ideals

Mathematics Subject Classification ID

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

Cited In (5)

• A survey on signature-based algorithms for computing Gröbner bases
• New constructive methods in classical ideal theory
• History and basic features of the critical-pair/completion procedure
• 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)