Improving incremental signature-based Groebner basis algorithms
Commutative Algebra
2012-03-27 v3
Abstract
In this paper we describe a combination of ideas to improve incremental signature-based Groebner basis algorithms having a big impact on their performance. Besides explaining how to combine already known optimizations to achieve more efficient algorithms, we compare the quite different effects on the two best-known algorithms in this area, F5 and G2V, both from a theoretical and a practical point of view.
Keywords
Cite
@article{arxiv.1201.6472,
title = {Improving incremental signature-based Groebner basis algorithms},
author = {Christian Eder},
journal= {arXiv preprint arXiv:1201.6472},
year = {2012}
}
Comments
19 pages, 3 tables