Parameterized problems complete for nondeterministic FPT time and logarithmic space

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 Extens...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information and computation Jg. 300; S. 105195
Hauptverfasser:	Bodlaender, Hans L., Groenland, Carla, Nederlof, Jesper, Swennenhuis, Céline
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.10.2024
ISSN:	0890-5401
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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. In particular, this implies that all these problems are W[t]-hard for all t.
ISSN:	0890-5401
DOI:	10.1016/j.ic.2024.105195