arXiv · 1101.3589
Signature-based algorithms to compute Groebner bases
Abstract
This paper describes a Buchberger-style algorithm to compute a Groebner basis of a polynomial ideal, allowing for a selection strategy based on "signatures". We explain how three recent algorithms can be viewed as different strategies for the new algorithm, and how other selection strategies can be formulated. We describe a fourth as an example. We analyze the strategies both theoretically and empirically, leading to some surprising results.
Explore related subjects
Keep this discovery
Christian Eder, John Perry. 2011-01-19. Signature-based algorithms to compute Groebner bases. https://arxiv.org/abs/1101.3589
Cite the original work for its findings. Save a collection to share your selection of sources.