Almost Global Problems in the LOCAL Model

05/12/2018
by   Alkida Balliu, et al.
0

The landscape of the distributed time complexity is nowadays well-understood for subpolynomial complexities. When we look at deterministic algorithms in the LOCAL model and locally checkable problems (LCLs) in bounded-degree graphs, the following picture emerges: - There are lots of problems with time complexities Θ(^* n) or Θ( n). - It is not possible to have a problem with complexity between ω(^* n) and o( n). - In general graphs, we can construct LCL problems with infinitely many complexities between ω( n) and n^o(1). - In trees, problems with such complexities do not exist. However, the high end of the complexity spectrum was left open by prior work. In general graphs there are problems with complexities of the form Θ(n^α) for any rational 0 < α< 1/2, while for trees only complexities of the form Θ(n^1/k) are known. No LCL problem with complexity between ω(√(n)) and o(n) is known, and neither are there results that would show that such problems do not exist. We show that: - In general graphs, we can construct LCL problems with infinitely many complexities between ω(√(n)) and o(n). - In trees, problems with such complexities do not exist. Put otherwise, we show that any LCL with a complexity o(n) can be solved in time O(√(n)) in trees, while the same is not true in general graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2021

Locally Checkable Labelings with Small Messages

A rich line of work has been addressing the computational complexity of ...
research
11/06/2017

New Classes of Distributed Time Complexity

A number of recent papers -- e.g. Brandt et al. (STOC 2016), Chang et al...
research
01/30/2020

The Lagrangian remainder of Taylor's series, distinguishes O(f(x)) time complexities to polynomials or not

The purpose of this letter is to investigate the time complexity consequ...
research
02/09/2022

The Landscape of Distributed Complexities on Trees and Beyond

We study the local complexity landscape of locally checkable labeling (L...
research
10/06/2015

Local Rademacher Complexity Bounds based on Covering Numbers

This paper provides a general result on controlling local Rademacher com...
research
09/21/2020

The Complexity Landscape of Distributed Locally Checkable Problems on Trees

Recent research revealed the existence of gaps in the complexity landsca...
research
01/28/2019

Space and complexities of territorial systems

The spatial character of territorial systems plays a crucial role in the...

Please sign up or login with your details

Forgot password? Click here to reset