Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleF5C: A variant of Faugère’s F5 algorithm with reduced Gröbner bases
Author(s) Christian Eder, John Perry
TypeArticle in Journal
AbstractThe structure of the F5 algorithm to compute Gr\"obner bases makes it very efficient. However, while it is believed to terminate for so-called regular sequences, it is not clear whether it terminates for all inputs. This paper has two major parts. In the first part, we describe in detail the difficulties related to a proof of termination. In the second part, we explore three variants that ensure termination. Two of these have appeared previously only in dissertations, and ensure termination by checking for a Gr\"obner basis using traditional criteria. The third variant, F5+, identifies a degree bound using a distinction between "necessary" and "redundant" critical pairs that follows from the analysis in the first part. Experimental evidence suggests this third approach is the most efficient of the three.
KeywordsF5; Buchberger’s criteria; Reduced Gröbner bases
Length16
LanguageEnglish
JournalJournal of Symbolic Computation
Volume45
Number12
Pages1442-1458
Year2010
MonthDecember
Translation No
Refereed No
Webmaster