Determining the complexity of computing Gr\"{o}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\"{o}bner bases of the ideal generated by an affine semi-regular sequence. This paper is a sequel of the authors' previous work and gives additional results on the solving degrees and important behaviors of Gr\"obner basis computation.

翻译：计算Gröbner基的复杂度在理论和实践中都是一个重要问题，而求解度在其中扮演关键角色。本文研究了仿射半正则序列及其齐次化序列的求解度。部分结果被认为为计算仿射半正则序列生成理想的Gröbner基的方法的正确性提供了数学上的严格证明。本文是作者前期工作的延续，并给出了关于求解度及Gröbner基计算重要行为的额外结果。