Loading...
Please wait, while we are loading the content...
Similar Documents
F5C: A variant of Faugère’s F5 algorithm with reduced Gröbner bases (2009)
| Content Provider | CiteSeerX |
|---|---|
| Author | Eder, Christian Perry, John |
| Abstract | Faugère's F5 algorithm computes a Gröbner basis incrementally, by computing a sequence of (non-reduced) Gröbner bases. The authors describe a variant of F5, called F5C, that replaces each intermediate Gröbner basis with its reduced Gröbner 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 Faugère's characterization theorem for Gröbner bases. |
| File Format | |
| Journal | JOURNAL OF SYMBOLIC COMPUTATION |
| Language | English |
| Publisher Date | 2009-01-01 |
| Access Restriction | Open |
| Subject Keyword | Faug Re F5 Algorithm Reduced Gr Bner Base Gr Bner Basis Gr Bner Base Faug Re Polynomial Reduction Characterization Theorem Intermediate Gr Bner Basis F5 Algorithm |
| Content Type | Text |
| Resource Type | Article |
