EUROSAM'79 conference proceedings
ACM SIGSAM Bulletin · 1979
We present a new criterion that may be applied in an algorithm for constructing Gröbner-bases of polynomial ideals. The application of the criterion may drastically reduce the number of reductions of polynomials in the course of the algorithm. Incidentally, the new criterion allows to derive a realistic upper bound for the degrees of the polynomials in the Gröbner-bases computed by the algorithm in the case of polynomials in two variables.