An improved algorithmic construction of Gröbner-bases for polynomial ideals
C. Kollreider, Bruno Buchberger · ACM SIGSAM Bulletin · 1978
In /1/, /2/ we gave an algorithm for the construction of so called Gröbner-bases of polynomial ideals. In this paper we present some new theoretical results by which the complexity of this algorithm may drastically be reduced in many cases.