Abstract
In Chapt. 2, we went over some of the central notions and results from the theory of classical complexity, that play a role in this thesis. In this chapter, we will give a similar overview of the area of parameterized complexity theory.
Parameterized complexity is based on a deal with the devil of intractability.
— Rod Downey and Mike Fellows,
Parameterized Complexity [67]
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer-Verlag GmbH Germany, part of Springer Nature
About this chapter
Cite this chapter
de Haan, R. (2019). Parameterized Complexity Theory. In: Parameterized Complexity in the Polynomial Hierarchy. Lecture Notes in Computer Science(), vol 11880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-60670-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-60670-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-60669-8
Online ISBN: 978-3-662-60670-4
eBook Packages: Computer ScienceComputer Science (R0)