3SUM猜想的高下界
Higher Lower Bounds from the 3SUM Conjecture
摘要:
3SUM猜想已被证明是证明动态数据结构和图问题的条件下界的有价值的工具。这项工作是由Ptrajeccu(STOC 2010)发起的,他将3SUM简化为离线SetDisjointness问题。然而,减少引入的Ptragarcu遭受从几个低效率,使其难以获得严格的条件下界从3SUM猜想。在本文中,我们解决了许多的不足之处,Ptracu的框架。我们给新的和有效的减少从3SUM离线SetDisjointness和离线SetIntersection(报告版本的SetDisjointness),导致多项式更高的几个问题的下界。使用我们的减少,我们能够显示几个算法的基本最优性,假设3SUM猜想。- Chiba和Nishizeki的$O(mα)$ -时间算法(SICOMP 1985)用于枚举具有荫度/退化度的图中的所有三角形$α$,对于任何$α$基本上是最优的。- Bjørklund、Pagh、Williams和Zwick列出$t$三角形的算法(ICALP 2014)本质上是最优的(假设矩阵乘法指数为$ω=2$)。- 在恒定时间内回答查询的SetDisjointness的任何静态数据结构都必须花费$Ω(N^{2-o(1)})$时间进行预处理,其中$N$是集合系统的大小。这些陈述是无法通过Ptracu的减少。我们还介绍了几个新的约简从3SUM到模式匹配问题和动态图问题。特别令人感兴趣的是新的条件下界的动态版本的最大基数匹配,引入了一种新的技术,获得摊销下界。
英文摘要:
The 3SUM conjecture has proven to be a valuable tool for proving conditional lower bounds on dynamic data structures and graph problems. This line of work was initiated by Pǎtraşcu (STOC 2010) who reduced 3SUM to an offline SetDisjointness problem. However, the reduction introduced by Pǎtraşcu suffers from several inefficiencies, making it difficult to obtain tight conditional lower bounds from the 3SUM conjecture. In this paper we address many of the deficiencies of Pǎtraşcu's framework. We give new and efficient reductions from 3SUM to offline SetDisjointness and offline SetIntersection (the reporting version of SetDisjointness) which leads to polynomially higher lower bounds on several problems. Using our reductions, we are able to show the essential optimality of several algorithms, assuming the 3SUM conjecture. - Chiba and Nishizeki's $O(mα)$-time algorithm (SICOMP 1985) for enumerating all triangles in a graph with arboricity/degeneracy $α$ is essentially optimal, for any $α$. - Bjørklund, Pagh, Williams, and Zwick's algorithm (ICALP 2014) for listing $t$ triangles is essentially optimal (assuming the matrix multiplication exponent is $ω=2$). - Any static data structure for SetDisjointness that answers queries in constant time must spend $Ω(N^{2-o(1)})$ time in preprocessing, where $N$ is the size of the set system. These statements were unattainable via Pǎtraşcu's reductions. We also introduce several new reductions from 3SUM to pattern matching problems and dynamic graph problems. Of particular interest are new conditional lower bounds for dynamic versions of Maximum Cardinality Matching, which introduce a new technique for obtaining amortized lower bounds.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。