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

随机性对局部可检验问题的帮助有多大?

How much does randomness help with locally checkable problems?

Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela

摘要:

局部可检验标号问题(LCL)是一种分布式图问题,如果一个解在所有常数半径邻域内都是局部可行的,则该解是全局可行的。顶点着色、极大独立集和极大匹配都是LCL的例子。一方面,众所周知,一些LCL从随机性中呈指数级受益--例如,任何找到无下沉方向的确定性分布式算法都需要$Θ(\log n)$轮,而问题的随机复杂性是$Θ(\log \log n)$轮。另一方面,也有许多LCL中的随机性是无用的。以前,不知道是否有任何LCL受益于随机性,但只有次指数。我们发现,这样的问题存在:例如,有一个LCL确定性的复杂性$Θ(\log^2 n)$轮和随机复杂性$Θ(\log n \log \log n)$轮。

英文摘要:

Locally checkable labeling problems (LCLs) are distributed graph problems in which a solution is globally feasible if it is locally feasible in all constant-radius neighborhoods. Vertex colorings, maximal independent sets, and maximal matchings are examples of LCLs. On the one hand, it is known that some LCLs benefit exponentially from randomness---for example, any deterministic distributed algorithm that finds a sinkless orientation requires $Θ(\log n)$ rounds in the LOCAL model, while the randomized complexity of the problem is $Θ(\log \log n)$ rounds. On the other hand, there are also many LCLs in which randomness is useless. Previously, it was not known if there are any LCLs that benefit from randomness, but only subexponentially. We show that such problems exist: for example, there is an LCL with deterministic complexity $Θ(\log^2 n)$ rounds and randomized complexity $Θ(\log n \log \log n)$ rounds.

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

↑