F5C: a variant of Faugere's F5 algorithm with reduced Groebner bases
Commutative Algebra
2011-05-19 v6 Algebraic Geometry
Abstract
Faugere's F5 algorithm computes a Groebner basis incrementally, by computing a sequence of (non-reduced) Groebner bases. The authors describe a variant of F5, called F5C, that replaces each intermediate Groebner basis with its reduced Groebner basis. As a result, F5C considers fewer polynomials and performs substantially fewer polynomial reductions, so that it terminates more quickly. We also provide a generalization of Faugere's characterization theorem for Groebner bases.
Keywords
Cite
@article{arxiv.0906.2967,
title = {F5C: a variant of Faugere's F5 algorithm with reduced Groebner bases},
author = {Christian Eder and John Perry},
journal= {arXiv preprint arXiv:0906.2967},
year = {2011}
}
Comments
31 pages, 4 tables; updated proof of characterization theorem