F4 Algorithm For Euclidean Rings
classification
🧮 math.AC
keywords
algorithmringseuclideanreductionbasisbuchbergercoefficientscomputes
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.