Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space.

Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis

Research output: Contribution to journalArticleAcademic


Let XNLP be the class of parameterized problems such that an instance of size n with parameter k can be solved nondeterministically in time f(k)nO(1) and space
f(k) log(n) (for some computable function f). We give a wide variety of XNLP-complete problems, such as List Coloring and Precoloring Extension with pathwidth as parameter, Scheduling of Jobs with Precedence Constraints, with both number of machines and partial order width as parameter, Bandwidth and variants of Weighted CNF-Satisfiability and reconfiguration problems. In particular, this implies that all these problems are W[t]-hard for all t. This also answers a long standing question on the parameterized complexity of the Bandwidth problem.
Original languageEnglish
Publication statusPublished - 2021

Bibliographical note

DBLP License: DBLP's bibliographic metadata records provided through are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.


Dive into the research topics of 'Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space.'. Together they form a unique fingerprint.

Cite this