On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness

Michael Elberfeld, Christoph Stockhusen*, Till Tantau

*Korrespondierende/r Autor/-in für diese Arbeit
8 Zitate (Scopus)


The parameterized complexity of a problem is generally considered “settled” once it has been shown to be fixed-parameter tractable or to be complete for a class in a parameterized hierarchy such as the weft hierarchy. Several natural parameterized problems have, however, resisted such a classification. In the present paper we argue that, in some cases, this is due to the fact that the parameterized complexity of these problems can be better understood in terms of their parameterized space or parameterized circuit complexity. This includes well-studied, natural problems like the feedback vertex set problem, the associative generability problem, or the longest common subsequence problem. We show that these problems lie in and may even be complete for different parameterized space classes, leading to new insights into the problems’ complexity. The classes we study are defined in terms of different forms of bounded nondeterminism and simultaneous time–space bounds.

Seiten (von - bis)661-701
PublikationsstatusVeröffentlicht - 16.10.2014


Untersuchen Sie die Forschungsthemen von „On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness“. Zusammen bilden sie einen einzigartigen Fingerprint.