The Complexity Landscape of Distributed Locally Checkable Problems on Trees

by   Yi-Jun Chang, et al.

Recent research revealed the existence of gaps in the complexity landscape of locally checkable labeling (LCL) problems in the LOCAL model of distributed computing. For example, the deterministic round complexity of any LCL problem on bounded-degree graphs is either O(log^∗ n) or Ω(log n) [Chang, Kopelowitz, and Pettie, FOCS 2016]. The complexity landscape of LCL problems is now quite well-understood, but a few questions remain open. For bounded-degree trees, there is an LCL problem with round complexity Θ(n^1/k) for each positive integer k [Chang and Pettie, FOCS 2017]. It is conjectured that no LCL problem has round complexity o(n^1/(k-1)) and ω(n^1/k) on bounded-degree trees. As of now, only the case of k = 2 has been proved [Balliu et al., DISC 2018]. In this paper, we show that for LCL problems on bounded-degree trees, there is indeed a gap between Θ(n^1/(k-1)) and Θ(n^1/k) for each k ≥ 2. Our proof is constructive in the sense that it offers a sequential algorithm that decides which side of the gap a given LCL problem belongs to. We also show that it is EXPTIME-hard to distinguish between Θ(1)-round and Θ(n)-round LCL problems on bounded-degree trees. This improves upon a previous PSPACE-hardness result [Balliu et al., PODC 2019].


page 1

page 2

page 3

page 4


On the Node-Averaged Complexity of Locally Checkable Problems on Trees

Over the past decade, a long line of research has investigated the distr...

The Landscape of Distributed Complexities on Trees and Beyond

We study the local complexity landscape of locally checkable labeling (L...

Almost Global Problems in the LOCAL Model

The landscape of the distributed time complexity is nowadays well-unders...

An Automatic Speedup Theorem for Distributed Problems

Recently, Brandt et al. [STOC'16] proved a lower bound for the distribut...

Efficient Classification of Local Problems in Regular Trees

We give practical, efficient algorithms that automatically determine the...

Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics

We study connections between distributed local algorithms, finitary fact...

Locally Checkable Labelings with Small Messages

A rich line of work has been addressing the computational complexity of ...

Please sign up or login with your details

Forgot password? Click here to reset