arXiv · 0906.2967
F5C: a variant of Faugere's F5 algorithm with reduced Groebner bases
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.
Explore related subjects
Keep this discovery
Christian Eder, John Perry. 2011-05-18. F5C: a variant of Faugere's F5 algorithm with reduced Groebner bases. https://doi.org/10.1016/j.jsc.2010.06.019
Cite the original work for its findings. Save a collection to share your selection of sources.