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

稀疏非负卷积的确定性和Las Vegas算法

Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution

Karl Bringmann, Nick Fischer, Vasileios Nakos

摘要:

计算两个长度为$n$的整数向量$A,B$的卷积$A\star B$是许多学科的核心问题.它经常出现在背包,$k$ -SUM,所有对最短路径和字符串模式匹配问题的算法中。对于这些应用,通常计算非负向量的卷积就足够了。这个问题可以用快速傅里叶变换在时间上经典地解决$O(n\log n)$。然而,通常所涉及的向量是稀疏的,因此可以希望输出敏感算法来计算非负卷积。这个问题由Muthukrishnan提出,Cole和Hariharan(STOC '02)通过在(未知)输出大小$t$中以接近线性时间运行的随机算法解决。Chan和Lewenstein(STOC '15)提出了一种确定性算法,在运行时间中具有$2^{O(\sqrt{\log t\cdot\log\log n})}$开销,并假设输出的超集很小;这个假设后来被Bringmann和Nakos(ICALP '21)删除。在本文中,我们提出了第一个确定性的近线性时间算法计算稀疏非负卷积。这立即给出了改进的确定性算法,用于输出敏感的子集和,块质量模式匹配,PDMATHAMT-fold布尔卷积等的最新技术,匹配到对数因子,这些问题的最快已知随机化算法。我们的算法是一个混合代数和组合的思想和技术。此外,我们提供了两个快速拉斯维加斯算法计算稀疏非负卷积。特别是,我们提出了一个简单的$O(t\log^2t)$时间算法,这是一个可访问的替代科尔和Hariharan的算法。我们进一步完善了这个新的算法运行在拉斯维加斯的时间$O(t\log t\cdot\log\log t)$,匹配的运行时间的密集的情况下,除了$\log\log t$因素。

英文摘要:

Computing the convolution $A\star B$ of two length-$n$ integer vectors $A,B$ is a core problem in several disciplines. It frequently comes up in algorithms for Knapsack, $k$-SUM, All-Pairs Shortest Paths, and string pattern matching problems. For these applications it typically suffices to compute convolutions of nonnegative vectors. This problem can be classically solved in time $O(n\log n)$ using the Fast Fourier Transform. However, often the involved vectors are sparse and hence one could hope for output-sensitive algorithms to compute nonnegative convolutions. This question was raised by Muthukrishnan and solved by Cole and Hariharan (STOC '02) by a randomized algorithm running in near-linear time in the (unknown) output-size $t$. Chan and Lewenstein (STOC '15) presented a deterministic algorithm with a $2^{O(\sqrt{\log t\cdot\log\log n})}$ overhead in running time and the additional assumption that a small superset of the output is given; this assumption was later removed by Bringmann and Nakos (ICALP '21). In this paper we present the first deterministic near-linear-time algorithm for computing sparse nonnegative convolutions. This immediately gives improved deterministic algorithms for the state-of-the-art of output-sensitive Subset Sum, block-mass pattern matching, $N$-fold Boolean convolution, and others, matching up to log-factors the fastest known randomized algorithms for these problems. Our algorithm is a blend of algebraic and combinatorial ideas and techniques. Additionally, we provide two fast Las Vegas algorithms for computing sparse nonnegative convolutions. In particular, we present a simple $O(t\log^2t)$ time algorithm, which is an accessible alternative to Cole and Hariharan's algorithm. We further refine this new algorithm to run in Las Vegas time $O(t\log t\cdot\log\log t)$, matching the running time of the dense case apart from the $\log\log t$ factor.

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

↑