Abstract
In the previous section, we made a first attempt to define a parameterized analogue of the class NP, without much success. In this section we will take up this question again. We shall see in the course of this book that there is no definite single class that can be viewed as "the parameterized NP." Rather, there is a whole hierarchy of classes playing this role. The classW[P] studied in this section can be placed on top of this hierarchy. It is one of the most important parameterized complexity classes.
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
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). The Class W[P]. In: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-29953-X_3
Download citation
DOI: https://doi.org/10.1007/3-540-29953-X_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29952-3
Online ISBN: 978-3-540-29953-0
eBook Packages: Computer ScienceComputer Science (R0)