通过加法组合学实现的可扩展的E3 SUM
Clustered Integer 3SUM via Additive Combinatorics
摘要:
我们提出了一个新的结果收集有关问题的3SUM,包括:1。$\ \ \ \ \ $ 1a的第一个真正的次二次算法。计算具有由$O(n)$,$\ \ \ \ \ $ 1b限定的整数值的单调递增序列的(min,+)卷积。求解2D中具有由$O(n)$和$\ \ \ \ \ $ 1c限定的整数坐标的单调集合的3SUM。预处理二进制字符串用于直方图索引(也称为混杂索引)。运行时间为:随机化的$O(n^{(9+\sqrt{177})/12}\,\textrm{polylog}\,n)=O(n^{1.859})$,或确定性的$O(n^{1.864})$。这大大改善了以前的$n^2/2^{Ω(\sqrt{\log n})}$的时间范围从威廉姆斯最近的结果对所有对最短路径[STOC'14],并回答了一个开放的问题提出了几个研究人员研究直方图索引问题。2.第一个算法的直方图索引的任何恒定的字母大小,实现真正的次二次预处理时间和真正的次线性查询时间。3.对于任意常数$δ>0$,当给定集合可以被划分为$n^{1-δ}$簇,每个簇被一个长度为$n$的区间覆盖时,整数3 SUM的一个真正的次二次算法。4.一种预处理任何$n$整数集的算法,以便随后在$O(n^{13/7}\,\textrm{polylog}\,n)$时间内求解任何给定子集上的3和。所有这些结果都是通过一种令人惊讶的新技术获得的,该技术基于加法组合学中的Bennett-Szemerédi-Gowers定理。
英文摘要:
We present a collection of new results on problems related to 3SUM, including: 1. The first truly subquadratic algorithm for $\ \ \ \ \ $ 1a. computing the (min,+) convolution for monotone increasing sequences with integer values bounded by $O(n)$, $\ \ \ \ \ $1b. solving 3SUM for monotone sets in 2D with integer coordinates bounded by $O(n)$, and $\ \ \ \ \ $1c. preprocessing a binary string for histogram indexing (also called jumbled indexing). The running time is: $O(n^{(9+\sqrt{177})/12}\,\textrm{polylog}\,n)=O(n^{1.859})$ with randomization, or $O(n^{1.864})$ deterministically. This greatly improves the previous $n^2/2^{Ω(\sqrt{\log n})}$ time bound obtained from Williams' recent result on all-pairs shortest paths [STOC'14], and answers an open question raised by several researchers studying the histogram indexing problem. 2. The first algorithm for histogram indexing for any constant alphabet size that achieves truly subquadratic preprocessing time and truly sublinear query time. 3. A truly subquadratic algorithm for integer 3SUM in the case when the given set can be partitioned into $n^{1-δ}$ clusters each covered by an interval of length $n$, for any constant $δ>0$. 4. An algorithm to preprocess any set of $n$ integers so that subsequently 3SUM on any given subset can be solved in $O(n^{13/7}\,\textrm{polylog}\,n)$ time. All these results are obtained by a surprising new technique, based on the Balog--Szemerédi--Gowers Theorem from additive combinatorics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。