# New classes of distributed time complexity

Loading...

##### Access rights

openAccess

##### Journal Title

##### Journal ISSN

##### Volume Title

Conference article in proceedings

This publication is imported from Aalto University research portal.

View publication in the Research portal

View/Open full text file from the Research portal

Other link related to publication

View publication in the Research portal

View/Open full text file from the Research portal

Other link related to publication

##### Date

2018-06-20

##### Department

##### Major/Subject

##### Mcode

##### Degree programme

##### Language

en

##### Pages

14

521-534

521-534

##### Series

STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing

##### Abstract

A number of recent papers – e.g. Brandt et al. (STOC 2016), Chang et al. (FOCS 2016), Ghaffari & Su (SODA 2017), Brandt et al. (PODC 2017), and Chang & Pettie (FOCS 2017) – have advanced our understanding of one of the most fundamental questions in theory of distributed computing: what are the possible time complexity classes of LCL problems in the LOCAL model? In essence, we have a graph problem Π in which a solution can be verified by checking all radius-O(1) neighbourhoods, and the question is what is the smallest T such that a solution can be computed so that each node chooses its own output based on its radius-T neighbourhood. Here T is the distributed time complexity of Π. The time complexity classes for deterministic algorithms in bounded-degree graphs that are known to exist by prior work are Θ(1), Θ(log∗ n), Θ(log n), Θ(n1/k), and Θ(n). It is also known that there are two gaps: one between ω(1) and o(log log∗ n), and another between ω(log∗ n) and o(log n). It has been conjectured that many more gaps exist, and that the overall time hierarchy is relatively simple – indeed, this is known to be the case in restricted graph families such as cycles and grids. We show that the picture is much more diverse than previously expected. We present a general technique for engineering LCL problems with numerous different deterministic time complexities, including Θ(logα n) for any α ≥ 1, 2Θ(log^α n) for any α ≤ 1, and Θ(nα) for any α < 1/2 in the high end of the complexity spectrum, and Θ(logα log∗ n) for any α ≥ 1, 2Θ(log^α log^∗ n) for any α ≤ 1, and Θ((log∗ n)α) for any α ≤ 1 in the low end of the complexity spectrum; here α is a positive rational number.##### Description

##### Keywords

distributed complexity theory, graph algorithms, locally checkable labellings, LOCAL model

##### Other note

##### Citation

Balliu, A, Hirvonen, J, Korhonen, J H, Lempiäinen, T, Olivetti, D & Suomela, J 2018, New classes of distributed time complexity . in STOC 2018 – Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing . ACM, pp. 1307-1318, ACM Symposium on Theory of Computing, Los Angeles, California, United States, 25/06/2018 . https://doi.org/10.1145/3188745.3188860