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

分布式问题的自动加速定理

An Automatic Speedup Theorem for Distributed Problems

Sebastian Brandt

摘要:

最近,Brandt等人。[STOC'16]证明了分布式Lovász局部引理的下界,Chang和Pettie [FOCS'17]已经证明了该下界对于充分放松的LLL准则是紧的。他们的结果的核心在于一个加速技术,对于周长至少为$2t+2$的图,将一个特定LLL问题的任何$t$轮算法转换为同一问题的$(t-1)$轮算法。我们大大提高了这种技术,表明这样的加速存在于任何本地可检查的问题$Π$,与不同的是,问题$Π_1$推断$(t-1)$轮算法解决的是不(一定)相同的问题作为$Π$。我们的加速是自动的,因为有一个固定的过程将$Π$的描述转换为$Π_1$的描述,并且是可逆的,因为用于$Π_1$的任何$(t-1)$轮算法都可以转换为用于$Π$的$t$轮算法。特别地,对于具有$n$节点、最大节点度$Δ$和围长至少为$2t+2$的图上的具有精确确定性时间复杂度$T(n, Δ) \leq t$的任何局部可检查问题$Π$,存在具有时间复杂度$T(n, Δ)-1, T(n, Δ)-2, \dots$的问题$Π_1, Π_2, \dots$的序列,其可以从$Π$推断。作为我们的广义加速的第一个应用程序,我们解决了一个长期存在的开放问题Naor和Stockmeyer [STOC'93]:我们表明,弱$2$染色奇数度图不能解决在$o(\log^* Δ)$轮,从而提供了一个匹配的下界,他们的上限。

英文摘要:

Recently, Brandt et al. [STOC'16] proved a lower bound for the distributed Lovász Local Lemma, which has been conjectured to be tight for sufficiently relaxed LLL criteria by Chang and Pettie [FOCS'17]. At the heart of their result lies a speedup technique that, for graphs of girth at least $2t+2$, transforms any $t$-round algorithm for one specific LLL problem into a $(t-1)$-round algorithm for the same problem. We substantially improve on this technique by showing that such a speedup exists for any locally checkable problem $Π$, with the difference that the problem $Π_1$ the inferred $(t-1)$-round algorithm solves is not (necessarily) the same problem as $Π$. Our speedup is automatic in the sense that there is a fixed procedure that transforms a description for $Π$ into a description for $Π_1$ and reversible in the sense that any $(t-1)$-round algorithm for $Π_1$ can be transformed into a $t$-round algorithm for $Π$. In particular, for any locally checkable problem $Π$ with exact deterministic time complexity $T(n, Δ) \leq t$ on graphs with $n$ nodes, maximum node degree $Δ$, and girth at least $2t+2$, there is a sequence of problems $Π_1, Π_2, \dots$ with time complexities $T(n, Δ)-1, T(n, Δ)-2, \dots$, that can be inferred from $Π$. As a first application of our generalized speedup, we solve a long-standing open problem of Naor and Stockmeyer [STOC'93]: we show that weak $2$-coloring in odd-degree graphs cannot be solved in $o(\log^* Δ)$ rounds, thereby providing a matching lower bound to their upper bound.

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

↑