On an installation of Buchberger's algorithm (Q1121950)

The authors describe a new version of the Buchberger algorithm for calculating Gröbner bases of polynomial ideals [\textit{B. Buchberger}, Multidimensional Systems Theory, Progress, directions and open problems, Math. Appl., D. Reidel Publ. Co. 16, 184-232 (1985; Zbl 0587.13009)]. It has the advantage that superfluous reductions of so-called S-polynomials are detected more easily thus speeding up the computations. The authors have implemented their version into the computer algebra systems \texttt{Scratchpad II} and \texttt{Reduce 3.3}. Several examples demonstrate that not only the running time is diminished but that the resulting Gröbner bases also have fewer elements.