计算格罗布纳基的新概念及其应用
A new conception for computing gröbner basis and its applications
摘要：
本文提出了一种计算格罗布纳基的概念。我们转换了一些gröbner计算算法，例如，F5，将F5和GWV算法推广为一类特殊的算法。新算法的有限终止问题可以用等价条件描述，从而可以确定上述算法何时终止。最后，提出了一种新的判据。它是对重写和签名准则的改进。
英文摘要：
This paper presents a conception for computing gröbner basis. We convert some of gröbner-computing algorithms, e.g., F5, extended F5 and GWV algorithms into a special type of algorithm. The new algorithm's finite termination problem can be described by equivalent conditions, so all the above algorithms can be determined when they terminate finitely. At last, a new criterion is presented. It is an improvement for the Rewritten and Signature Criterion.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
