The complexity landscape of distributed locally checkable problems on trees
OPEN ACCESS
Loading...
Author / Producer
Date
2020-10-07
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
OPEN ACCESS
Data
Rights / License
Abstract
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].
Permanent link
Publication status
published
External links
Editor
Book title
34th International Symposium on Distributed Computing (DISC 2020)
Volume
179
Pages / Article No.
Publisher
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Event
34th International Symposium on Distributed Computing (DISC 2020) (virtual)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
02889 - ETH Institut für Theoretische Studien / ETH Institute for Theoretical Studies
Notes
Conference lecture held on October 14, 2020. Due to the Coronavirus (COVID-19) the conference was conducted virtually.
Funding
Related publications and datasets
Is variant form of: https://arxiv.org/abs/2009.09645