arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2203.11675cs.CC
收藏

$O(n^{11}\log(n))$中的子集和

Subset Sum in $O(n^{11}\log(n))$

Rion Tolchin

摘要:

本文介绍了一种算法(迄今为止被称为“蜻蜓算法”),通过它可以解决子集和问题的$O(n^{11}\log(n))$时间复杂度。本文将首先详细介绍广义“乘积-导数”法(以及将在算法中使用的该方法的更有效的版本),通过该方法,一对一元多项式可以用于生成唯一一元多项式的系统,对于该系统,系统中的每个多项式将彼此共享一组根,该组根等价于原始对的根的交集;然后,将该方法应用于一对多项式,其中一个多项式$ϕ(x)$基于子集和问题的实例展示已知的根,而另一个多项式$t(x)$包含未知的占位符系数并表示$ϕ(x)$的线性因子的未知子集。

英文摘要:

This paper describes an algorithm (thus far referred to as the "Dragonfly Algorithm") by which the subset-sum problem can be solved in $O(n^{11}\log(n))$ time complexity. The paper will first detail the generalized "product-derivative" method (and the more efficient version of this method which will be used in the algorithm) by which a pair of monic polynomials can be used to generate a system of unique monic polynomials for which each polynomial in the system will share with every other a set of roots equivalent to the intersection of the roots of the original pair; this method will then be applied on a pair of polynomials one of which, $ϕ(x)$, exhibiting known roots based on the instance of the subset-sum problem and the other of which, $t(x)$, containing unknown placeholder coefficients and representing an unknown subset of the linear factors of $ϕ(x)$.

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

↑