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

DOI10.1145/1088261.1088267zbMath0417.68028OpenAlexW2007704220MaRDI QIDQ3208083

Bruno Buchberger, C. Kollreider

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)

Related Items

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