Displaying similar documents to “Towards the automated synthesis of a Gröbner bases algorithm.”

The F4-algorithm for Euclidean rings

Afshan Sadiq (2010)

Open Mathematics

Similarity:

In this short note, we extend Faugére’s F4-algorithm for computing Gröbner bases to polynomial rings with coefficients in an Euclidean ring. Instead of successively reducing single S-polynomials as in Buchberger’s algorithm, the F4-algorithm is based on the simultaneous reduction of several polynomials.