Skip to Main content Skip to Navigation
Journal articles

A survey on signature-based algorithms for computing Gröbner basis computations

Christian Eder 1 Jean-Charles Faugère 2 
2 PolSys - Polynomial Systems
LIP6 - Laboratoire d'Informatique de Paris 6, Inria de Paris
Abstract : This paper is a survey on the area of signature-based Gröbner basis algorithms that was initiated by Faugère's F5 algorithm in 2002. We explain the general ideas behind the usage of signatures. We show how to classify the various known variants by 3 different orderings. For this we give translations between different notations and show that besides notations many approaches are just the same. Moreover, we give a general description of how the idea of signatures is quite natural when performing the reduction process using linear algebra. This survey shall help to outline this field of active research.
Complete list of metadata

Cited literature [83 references]  Display  Hide  Download
Contributor : Jean-Charles Faugère Connect in order to contact the contributor
Submitted on : Monday, November 21, 2016 - 5:08:35 PM
Last modification on : Friday, July 8, 2022 - 10:05:53 AM
Long-term archiving on: : Tuesday, March 21, 2017 - 11:54:10 AM


survey (1).pdf
Files produced by the author(s)



Christian Eder, Jean-Charles Faugère. A survey on signature-based algorithms for computing Gröbner basis computations. Journal of Symbolic Computation, Elsevier, 2016, pp.1-75. ⟨10.1016/j.jsc.2016.07.031⟩. ⟨hal-00974810v2⟩



Record views


Files downloads