Improving incremental signature-based Gröbner basis algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Communications in Computer Algebra Year : 2013

Improving incremental signature-based Gröbner basis algorithms

Abstract

In this paper we describe a combination of ideas to improve incremental signature-based Gröbner basis algorithms having a big impact on their performance. Besides explaining how to combine already known optimizations to achieve more efficient algorithms, we show how to improve them even more. Although our idea has a positive affect on all kinds of incremental signature-based algorithms, the way this impact is achieved can be quite different. Based on the two best-known algorithms in this area, F5 and G2V, we explain our idea, both from a theoretical and a practical point of view.
No file

Dates and versions

hal-00930293 , version 1 (14-01-2014)

Identifiers

Cite

Christian Eder. Improving incremental signature-based Gröbner basis algorithms. ACM Communications in Computer Algebra, 2013, 47 (1), pp.1-13. ⟨10.1145/2503697.2503699⟩. ⟨hal-00930293⟩
109 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More