Parameterized Distributed Complexity Theory: A logical approach

03/01/2019
by   Sebastian Siebertz, et al.
0

Parameterized complexity theory offers a framework for a refined analysis of hard algorithmic problems. Instead of expressing the running time of an algorithm as a function of the input size only, running times are expressed with respect to one or more parameters of the input instances. In this work we follow the approach of parameterized complexity to provide a framework of parameterized distributed complexity. The central notion of efficiency in parameterized complexity is fixed-parameter tractability and we define the distributed analogue Distributed-FPT (for Distributed in {Local, Congest, Congested-Clique}) as the class of problems that can be solved in f(k) communication rounds in the Distributed model of distributed computing, where k is the parameter of the problem instance and f is an arbitrary computable function. To classify hardness we introduce three hierarchies. The Distributed-WEFT-hierarchy is defined analogously to the W-hierarchy in parameterized complexity theory via reductions to the weighted circuit satisfiability problem, but it turns out that this definition does not lead to satisfying frameworks for the Local and Congest models. We then follow a logical approach that leads to a more robust theory. We define the levels of the Distributed-W-hierarchy and the Distributed-A-hierarchy that have first-order model-checking problems as their complete problems via suitable reductions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/14/2019

Parameterized Fine-Grained Reductions

During recent years the field of fine-grained complexity has bloomed to ...
research
05/16/2023

A Local Perspective on the Polynomial Hierarchy

We extend classical methods of computational complexity to the setting o...
research
11/20/2019

Towards a Theory of Parameterized Streaming Algorithms

Parameterized complexity attempts to give a more fine-grained analysis o...
research
05/04/2023

On the parameterized complexity of the Perfect Phylogeny problem

This paper categorizes the parameterized complexity of the algorithmic p...
research
03/15/2022

Quantum Parameterized Complexity

Parameterized complexity theory was developed in the 1990s to enrich the...
research
05/31/2021

Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space

Let XNLP be the class of parameterized problems such that an instance of...
research
11/05/2018

Probabilistic Parameterized Polynomial Time

We examine a parameterized complexity class for randomized computation w...

Please sign up or login with your details

Forgot password? Click here to reset