A survey on signature-based algorithms for computing Gröbner bases
Authors:
- Christian EderCEChristian Eder
- Jean-Charles FaugèreJFJean-Charles Faugère
- 1 May 2017
- journal article
- research article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 80, 719-784
Abstract
No abstract availableKeywords
Funding Information
- French National Research Agency (ANR-09-BLAN-0371-01)
This publication has 32 references indexed in Scilit:
- An analysis of inhomogeneous signature-based Gröbner basis computationsJournal of Symbolic Computation, 2013
- Involutive bases algorithm incorporating F5 criterionJournal of Symbolic Computation, 2013
- On the use of Buchberger criteria in G2V algorithm for calculating Gröbner basesProgramming and Computer Software, 2013
- On the relation between the MXL family of algorithms and Gröbner basis algorithmsJournal of Symbolic Computation, 2012
- The F5 criterion revisedJournal of Symbolic Computation, 2011
- Extended F5 criteriaJournal of Symbolic Computation, 2010
- F5C: A variant of Faugère’s F5 algorithm with reduced Gröbner basesJournal of Symbolic Computation, 2010
- Bruno Buchberger’s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial idealJournal of Symbolic Computation, 2006
- Gr bner bases of ideals defined by functionals with an application to ideals of projective pointsApplicable Algebra in Engineering, Communication and Computing, 1993
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen GleichungssystemsAequationes mathematicae, 1970