Reducing the size and number of linear programs in a dynamic Grbner basis algorithm
The goal of the Dynamic Buchberger Algorithm is to compute a Grbner basis quickly by adjusting the term ordering as the computation proceeds. A known problem concerns the size and number of linear progams to be solved when refining the ordering. This paper describes two methods for reducing both their size and number.
dynamic buchberger algorithm term ordering grbner bases boundary vectors 13p10 68w30