An analysis of inhomogeneous signature-based Gröbner basis computations

Christian Eder 1
1 PolSys - Polynomial Systems
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : In this paper we give an insight into the behaviour of signature-based Gröbner basis algorithms, like F5, G2V or SB, for inhomogeneous input. On the one hand, it seems that the restriction to sig-safe reductions puts a penalty on the performance. The lost connection between polynomial degree and signature degree can disallow lots of reductions and can lead to an overhead in the computations. On the other hand, the way critical pairs are sorted and corresponding s-polynomials are handled in signature- based algorithms is a very efficient one, strongly connected to sorting w.r.t. the well-known sugar degree of polynomials.
Type de document :
Article dans une revue
Journal of Symbolic Computation, Elsevier, 2013, 59, pp.21--35. <10.1016/j.jsc.2013.08.001>
Liste complète des métadonnées

https://hal.inria.fr/hal-00930286
Contributeur : Elias Tsigaridas <>
Soumis le : mardi 14 janvier 2014 - 15:37:52
Dernière modification le : lundi 29 mai 2017 - 14:26:16

Identifiants

Collections

Citation

Christian Eder. An analysis of inhomogeneous signature-based Gröbner basis computations. Journal of Symbolic Computation, Elsevier, 2013, 59, pp.21--35. <10.1016/j.jsc.2013.08.001>. <hal-00930286>

Partager

Métriques

Consultations de la notice

109