The solving degrees for computing Gröbner bases of affine semi-regular polynomial sequences

ePrint Report: The solving degrees for computing Gröbner bases of affine semi-regular polynomial sequences

Momonari Kudo, Kazuhiro Yokoyama

Determining the complexity of computing Gröbner bases is an important problem both in theory and in practice, and for that the solving degree plays a key role. In this paper, we study the solving degrees of affine semi-regular sequences and their homogenized sequences. Some of our results are considered to give mathematically rigorous proofs of the correctness of methods for computing Gröbner …

complexity computing eprint report important key practice problem regular report role semi theory