F4 Algorithm For Euclidean Rings
Commutative Algebra
2010-06-09 v1
Abstract
This short note is the generalization of Faugere F4-algorithm for polynomial rings with coefficients in Euclidean rings. This algorithm computes successively a Groebner basis replacing the reduction of one single s-polynomial in Buchberger's algorithm by the simultaneous reduction of several polynomials.
Cite
@article{arxiv.1006.1456,
title = {F4 Algorithm For Euclidean Rings},
author = {Afshan Sadiq},
journal= {arXiv preprint arXiv:1006.1456},
year = {2010}
}