LOCAL模型中的几乎全局问题
Almost Global Problems in the LOCAL Model
摘要:
分布式时间复杂度的景观现在被很好地理解为次多项式复杂度。当我们在有界度图中查看确定性算法和局部可检查问题(LCL)时,出现了以下图片:-有很多问题的时间复杂度为$Θ(\log^* n)$或$Θ(\log n)$。- $ω(\log^* n)$和$o(\log n)$之间不可能存在复杂性问题。- 在一般的图中,我们可以构造具有无穷多个复杂度的LCL问题,介于$ω(\log n)$和$n^{o(1)}$之间。- 在树中,不存在如此复杂的问题。然而,高端的复杂性频谱是开放的,由以前的工作。在一般的图中,对于任何有理$0 < α\le 1/2$,都存在具有$Θ(n^α)$形式的复杂性的LCL问题,而对于树,只有$Θ(n^{1/k})$形式的复杂性是已知的。没有已知的复杂性介于$ω(\sqrt{n})$和$o(n)$之间的LCL问题,也没有结果表明这样的问题不存在。我们表明:-在一般的图,我们可以构建LCL问题之间的$ω(\sqrt{n})$和$o(n)$无限多的复杂性。- 在树中,不存在如此复杂的问题。换句话说,我们表明,任何LCL的复杂性$o(n)$可以解决的时间$O(\sqrt{n})$在树,而在一般的图形是不正确的。
英文摘要:
The landscape of the distributed time complexity is nowadays well-understood for subpolynomial complexities. When we look at deterministic algorithms in the LOCAL model and locally checkable problems (LCLs) in bounded-degree graphs, the following picture emerges: - There are lots of problems with time complexities of $Θ(\log^* n)$ or $Θ(\log n)$. - It is not possible to have a problem with complexity between $ω(\log^* n)$ and $o(\log n)$. - In general graphs, we can construct LCL problems with infinitely many complexities between $ω(\log n)$ and $n^{o(1)}$. - In trees, problems with such complexities do not exist. However, the high end of the complexity spectrum was left open by prior work. In general graphs there are LCL problems with complexities of the form $Θ(n^α)$ for any rational $0 < α\le 1/2$, while for trees only complexities of the form $Θ(n^{1/k})$ are known. No LCL problem with complexity between $ω(\sqrt{n})$ and $o(n)$ is known, and neither are there results that would show that such problems do not exist. We show that: - In general graphs, we can construct LCL problems with infinitely many complexities between $ω(\sqrt{n})$ and $o(n)$. - In trees, problems with such complexities do not exist. Put otherwise, we show that any LCL with a complexity $o(n)$ can be solved in time $O(\sqrt{n})$ in trees, while the same is not true in general graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。