The F\(_{4}\)-algorithm for Euclidean rings (Q632251)

In 1999, \textit{J.-Ch. Faugére} [J. Pure Appl. Algebra 139, No. 1--3, 61--88 (1999; Zbl 0930.68174)] published a new efficient algorithm for computing Gröbner bases, now known as Faugére's F\(_{4}\)-algorithm. Instead of successively reducing single \(S\)-polynomials, as in Buchberger's algorithm, the F4-algorithm is based on the simultaneous reduction of several polynomials. In the short paper under review the author shows that Faugére's F\(_{4}\)-algorithm works in polynomial rings over Euclidean rings.