On The Criteria Of The F5 Algorithm

Details On The Criteria Of The F5 Algorithm On The Criteria Of The F5 Algorithm

2008-04-12

arxiv.org/abs/0804.2033v4

Mathematics

Commutative Algebra

1 new citation, new introduction, appendix about SINGULAR implementation

Scientific paper

Faugere's F5 algorithm is one of the fastest known algorithms for the computation of Grobner bases. So far only the F5 Criterion is proved, whereas the second powerful criterion, the Rewritten Criterion, is not understood very well until now. We give a proof of both, the F5 Criterion and the Rewritten Criterion showing their connection to syzygies, i.e. the relations between the S-Polynomials to be investigated by the algorithm. Using the example of a Grobner basis computation stated in Faugere's F5 paper we show how the criteria work, and discuss the possibility of improving the F5 Criterion. An introduction to a SINGULAR implementation of F5 is given in the end.

Affiliated with

Also associated with

No associations

Rating

On The Criteria Of The F5 Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On The Criteria Of The F5 Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On The Criteria Of The F5 Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-505809