New Classes of Distributed Time Complexity

11/06/2017
by   Alkida Balliu, et al.
0

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), Θ(^* n), Θ( n), Θ(n^1/k), and Θ(n). It is also known that there are two gaps: one between ω(1) and o(^* n), and another between ω(^* n) and o( n). It has been conjectured that many more gaps would exist, and that the overall time hierarchy would be 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 Θ( ^p/q n ), 2^Θ( ^q/p n ), and Θ(n^pq/(p+q)^2) in the high end and Θ( ^p/q^* n ), 2^Θ( ^q/p^* n ), and Θ((^* n)^q/p) in the low end of the complexity spectrum (p > q).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2018

Almost Global Problems in the LOCAL Model

The landscape of the distributed time complexity is nowadays well-unders...
research
07/18/2019

Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems

Consider a graph problem that is locally checkable but not locally solva...
research
03/25/2021

Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics

We classify which local problems with inputs on oriented paths have so-c...
research
07/24/2017

Domain Recursion for Lifted Inference with Existential Quantifiers

In recent work, we proved that the domain recursion inference rule makes...
research
12/14/2019

A decentralized algorithm for network node counting

Node counting on a graph is subject to some fundamental theoretical limi...
research
04/20/2018

Enumeration in Incremental FPT-Time

In this paper, we study the relationship of parametrised enumeration com...
research
03/15/2021

Of Toasts and Tails

We present an intimate connection among the following fields: (a) dist...

Please sign up or login with your details

Forgot password? Click here to reset