arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.13170cs.CCcs.DS
收藏

子集和问题的改进空间界限

Improved Space Bounds for Subset Sum

Tatiana Belova, Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin

AI总结:

本文通过引入随机素数过滤子集族并将其与Schroeppel-Shamir算法及表示技术结合,将子集和问题的空间上界从$O^*(2^{0.249999n})$改进为$O^*(2^{0.246n})$,同时简化了Nederlof和Węgrzycki的算法及其分析。

摘要:

40多年前,Schroeppel和Shamir提出了一种算法,能在时间$O^*(2^{0.5n})$和空间$O^*(2^{0.25n})$内解决$n$个整数的子集和问题。其时间上界至今未被打破,但空间上界在Nederlof和Węgrzycki(STOC 2021)近期的一篇突破性论文中被改进为$O^*(2^{0.249999n})$。他们的算法巧妙地将多种已知技术与一种新的归约和一种新的正交向量问题算法相结合。在本文中,我们将Nederlof和Węgrzycki的空间界限改进为$O^*(2^{0.246n})$,同时简化了他们的算法及其分析。我们实现这一目标的方法是采用Howgrave-Graham和Joux提出的一个想法,即使用随机素数来过滤子集族。我们将该想法融入Schroeppel和Shamir的算法中,然后在表示技术内部使用这种融合方法。这使我们能够将一个子集和实例归约为更多数量的加权正交向量实例。

英文摘要:

More than 40 years ago, Schroeppel and Shamir presented an algorithm that solves the Subset Sum problem for $n$ integers in time $O^*(2^{0.5n})$ and space $O^*(2^{0.25n})$. The time upper bound remains unbeaten, but the space upper bound has been improved to $O^*(2^{0.249999n})$ in a recent breakthrough paper by Nederlof and Węgrzycki (STOC 2021). Their algorithm is a clever combination of a number of previously known techniques with a new reduction and a new algorithm for the Orthogonal Vectors problem. In this paper, we improve the space bound by Nederlof and Węgrzycki to $O^*(2^{0.246n})$ and also simplify their algorithm and its analysis. We achieve this by using an idea, due to Howgrave-Graham and Joux, of using a random prime number to filter the family of subsets. We incorporate it into the algorithm by Schroeppel and Shamir and then use this amalgam inside the representation technique. This allows us to reduce an instance of Subset Sum to a larger number of instances of weighted orthogonal vector.

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

↑