@inproceedings{1ae48d5481444f47a1797fd15c8cdf6c,
title = "From the W-hierarchy to XNLP: Classes of Fixed Parameter Intractability",
abstract = "In this short survey, a number of old and new notions from parameterized complexity are discussed. We start with looking at the W-hierarchy, including the classes W[1], W[2], W[P]. Then, a recent development where problems are shown to be complete for simultaneously non-deterministic time of the form f(k) nc and space of the form f(k) log n, is discussed. Some consequences and other notions are briefly explored.",
keywords = "Parameterized complexity, W-hierarchy, XNLP, XP",
author = "Bodlaender, {Hans L.}",
note = "Publisher Copyright: {\textcopyright} 2022, Springer Nature Switzerland AG.; 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022 ; Conference date: 24-03-2022 Through 26-03-2022",
year = "2022",
month = feb,
day = "22",
doi = "10.1007/978-3-030-96731-4_2",
language = "English",
isbn = "978-3-030-96730-7",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "15--25",
editor = "Petra Mutzel and Rahman, {Md. Saidur} and Slamin",
booktitle = "WALCOM: Algorithms and Computation",
edition = "1",
}