Reducing the size and number of linear programs in a dynamic Gr?bner basis algorithm

摘要

The goal of the Dynamic Buchberger Algorithm is to compute a Gr?bner basis quickly by adjusting the term ordering as the computation proceeds. A known problem concerns the size and number of linear progams to be solvedwhen refining the ordering. This paper describes two methods for reducing both their size and number.