基于3SUM约简的加法结构去除
Removing Additive Structure in 3SUM-Based Reductions
摘要:
我们的工作探讨了没有某些添加剂结构的$3$ SUM实例的硬度,及其应用。作为我们的主要技术结果,我们表明,在$3$ SUM假设下,在大小为$n$的整数集上求解$3$ SUM,避免了对$\{a, b\} \ne \{c, d\}$的$a+b=c+d$的求解,仍然需要$n^{2-o(1)}$时间。这样的集合被称为西顿集,在加法组合学领域得到了很好的研究。- 结合前面的约简,这意味着在$3$ SUM假设下,$n$ -顶点图上的所有边稀疏三角形问题具有最大度$\sqrt{n}$和对于每个$k \ge 3$至多$n^{k/2}$ $k$ -循环需要$n^{2-o(1)}$时间。这可以用来加强先前的条件下界由Abboud,Bringmann,Khoury和Zamir [STOC'22]的$4$ -循环枚举,离线近似距离Oracle和近似动态最短路径。我们证明了对于具有$n^{o(1)}$延迟的$n$ -顶点$m$ -边图上的$4$ -循环枚举问题,没有算法具有$O(n^{2-\varepsilon})$或$O(m^{4/3-\varepsilon})$预$\varepsilon >0$的处理时间。我们还提出了一个匹配的上限,通过简单的修改已知的算法$4$周期检测。- 主要结果的轻微推广也扩展了Dudek,Gawrychowski和Starikovskaya [STOC'20]关于非平凡3变量线性退化测试(3-LDTs)的$3$ SUM硬度的结果:我们显示了所有非平凡4-LDTs的$3$ SUM硬度。我们的主要技术结果的证明结合了广泛的工具:Balog-Szemer{é}di-Gowers定理,稀疏卷积算法和一个新的几乎线性哈希函数,几乎$3$ -不具有小系数线性关系的整数的通用保证。
英文摘要:
Our work explores the hardness of $3$SUM instances without certain additive structures, and its applications. As our main technical result, we show that solving $3$SUM on a size-$n$ integer set that avoids solutions to $a+b=c+d$ for $\{a, b\} \ne \{c, d\}$ still requires $n^{2-o(1)}$ time, under the $3$SUM hypothesis. Such sets are called Sidon sets and are well-studied in the field of additive combinatorics. - Combined with previous reductions, this implies that the All-Edges Sparse Triangle problem on $n$-vertex graphs with maximum degree $\sqrt{n}$ and at most $n^{k/2}$ $k$-cycles for every $k \ge 3$ requires $n^{2-o(1)}$ time, under the $3$SUM hypothesis. This can be used to strengthen the previous conditional lower bounds by Abboud, Bringmann, Khoury, and Zamir [STOC'22] of $4$-Cycle Enumeration, Offline Approximate Distance Oracle and Approximate Dynamic Shortest Path. In particular, we show that no algorithm for the $4$-Cycle Enumeration problem on $n$-vertex $m$-edge graphs with $n^{o(1)}$ delays has $O(n^{2-\varepsilon})$ or $O(m^{4/3-\varepsilon})$ pre-processing time for $\varepsilon >0$. We also present a matching upper bound via simple modifications of the known algorithms for $4$-Cycle Detection. - A slight generalization of the main result also extends the result of Dudek, Gawrychowski, and Starikovskaya [STOC'20] on the $3$SUM hardness of nontrivial 3-Variate Linear Degeneracy Testing (3-LDTs): we show $3$SUM hardness for all nontrivial 4-LDTs. The proof of our main technical result combines a wide range of tools: Balog-Szemer{é}di-Gowers theorem, sparse convolution algorithm, and a new almost-linear hash function with almost $3$-universal guarantee for integers that do not have small-coefficient linear relations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。