Signature-based algorithms to compute Gröbner bases
Christian Eder, J. E. Perry · 2011
Abstract This paper describes a Buchberger-style algorithm to compute a Grobner 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.