Consider any locally checkable labeling problem $\Pi$ in rooted regular trees: there is a finite set of labels $\Sigma$, and for each label $x \in \Sigma$ we specify what are permitted label combinations of the children for an internal node of label $x$ (the leaf nodes are unconstrained). This formalism is expressive enough to capture many classic problems studied in distributed computing, including vertex coloring, edge coloring, and maximal independent set. We show that the distributed computational complexity of any such problem $\Pi$ falls in one of the following classes: it is $O(1)$, $\Theta(\log^* n)$, $\Theta(\log n)$, or $\Theta(n)$ rounds in trees with $n$ nodes (and all of these classes are nonempty). We show that the complexity of any given problem is the same in all four standard models of distributed graph algorithms: deterministic LOCAL, randomized LOCAL, deterministic CONGEST, and randomized CONGEST model. In particular, we show that randomness does not help in this setting, and complexity classes such as $\Theta(\log \log n)$ or $\Theta(\sqrt{n})$ do not exist (while they do exist in the broader setting of general trees). We also show how to systematically determine the distributed computational complexity of any such problem $\Pi$. We present an algorithm that, given the description of $\Pi$, outputs the round complexity of $\Pi$ in these models. While the algorithm may take exponential time in the size of the description of $\Pi$, it is nevertheless practical: we provide a freely available implementation of the classifier algorithm, and it is fast enough to classify many typical problems of interest.
翻译:考虑任何本地检查标签问题 $\ Pi 根植常规树中的任何问题 : 有一套限定的标签 $\ sigma$, 对于每个标签 $x\ in\ sigma$, 我们为标签内部节点$x$( 叶节点不受限制) 指定了允许的子体标签组合 $x$( 叶节点不受限制 ) 。 这种形式主义足以反映分布计算中研究的许多经典问题, 包括顶端颜色、 边缘颜色和最大独立的数据集 。 我们显示, 任何这类问题分布式的分布式计算复杂性 $( 确定性 LOCAL 、 确定性CONEST ) 出现在以下一个类别中: $1, 美元( 美元) 美元( 美元) 美元( 美元) 或美元( 美元) 美元( 美元( ) 美元( ) 美元( 美元) 。 在常规计算中, 多少( ) 或( 美元( 美元) 美元( ) 美元) 数字( ) 数字( ) 数字( ) 数字( ) 数字( ) 数字( ) 数字( ) 数字( ) ) ) 数字( ) 的计算过程( ) ( ) ( ) ) ( ) ) ) ( ) ( ) ( ) ( ) ( ) ) ( ) (我们( ) ( ) ) (我们( ) ( ) ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ) ( ) ( ) ( ) ( ) ( ) ( ) ) ( ) ( ) ) ( ) ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ) ) ) ) ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) (