arXiv · 1201.6472
Improving incremental signature-based Groebner basis algorithms
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.
Explore related subjects
Keep this discovery
Christian Eder. 2012-03-26. Improving incremental signature-based Groebner basis algorithms. https://arxiv.org/abs/1201.6472
Cite the original work for its findings. Save a collection to share your selection of sources.