THE F5 ALGORITHM IN BUCHBERGER＇S STYLE
The famous F5 algorithm for computing Grobner basis was presented by Faugere in 2002. The original version of F5 is given in programming codes, so it is a bit difficult to understand. In this paper, the F5 algorithm is simplified as F5B in a Buchberger＇s style such that it is easy to understand and...
Gespeichert in:
| Veröffentlicht in: | 系统科学与复杂性：英文版 2011, Vol.24 (6), p.1218-1231 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | The famous F5 algorithm for computing Grobner basis was presented by Faugere in 2002. The original version of F5 is given in programming codes, so it is a bit difficult to understand. In this paper, the F5 algorithm is simplified as F5B in a Buchberger＇s style such that it is easy to understand and implement. In order to describe F5B, we introduce F5-reduction, which keeps the signature of labeled polynomials unchanged after reduction. The equivalence between F5 and F5B is also shown. At last, some versions of the F5 algorithm are illustrated. |
|---|---|
| ISSN: | 1009-6124 1559-7067 |