arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1108.1301cs.SC
收藏

基于符号的Groebner基算法求解多项式环的可分离性问题

Solving Detachability Problem for the Polynomial Ring by Signature-based Groebner Basis Algorithms

Yao Sun, Dingkang Wang

摘要:

基于签名的算法是计算Groebner基的一种常用算法,包括著名的F5算法、F5C、扩展的F5、G2V和GVW算法。本文提出了一种有效的方法来解决可扩展性问题。新方法只使用基于签名算法的输出,不需要额外的Groebner基计算。当Groebner基由基于签名的算法得到时,可验证性问题可以在多项式时间内解决。

英文摘要:

Signature-based algorithms are a popular kind of algorithms for computing Groebner basis, including the famous F5 algorithm, F5C, extended F5, G2V and the GVW algorithm. In this paper, an efficient method is proposed to solve the detachability problem. The new method only uses the outputs of signature-based algorithms, and no extra Groebner basis computations are needed. When a Groebner basis is obtained by signature-based algorithms, the detachability problem can be settled in polynomial time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑