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

Christian Eder 1 Jean-Charles Faugère 2
2 PolSys - Polynomial Systems
Inria de Paris, LIP6 - Laboratoire d'Informatique de Paris 6
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.
Type de document :
Article dans une revue
Journal of Symbolic Computation, Elsevier, 2016, pp.1-75. 〈10.1016/j.jsc.2016.07.031〉
Liste complète des métadonnées

Littérature citée [83 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00974810
Contributeur : Jean-Charles Faugère <>
Soumis le : lundi 21 novembre 2016 - 17:08:35
Dernière modification le : mercredi 9 mai 2018 - 15:46:13
Document(s) archivé(s) le : mardi 21 mars 2017 - 11:54:10

Fichier

survey (1).pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

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〉

Partager

Métriques

Consultations de la notice

271

Téléchargements de fichiers

142