Abstract
In the last chapter, we looked at one of the ingredients of classical hardness results: the notion of a reducibility. The other basic ingredient is the identification of classes of intractable problems. In the case of NP-completeness, recall that a language L is a member of the class NP iff there is a polynomial-time relation R and a polynomial p such that x ∈ L iff ∃y[|y| ≤ p(|x|) ∧ R(x, y) holds] For instance, if L is the collection of satisfiable formulas, then a formula x is satisfiable iff there is some satisfying assignment y of the variables. Recall that L is NP-complete iff L ∈ NP, and for any language L1 ∈ N P, L1 ≤ p m L. The hidden beauty and power of these definitions comes from the profound discovery that there are literally thousands of important and natural NP-complete problems. If any of them were solvable in polynomial-time, then all of them would be. Moreover, other than a few exceptions, if a natural problem is in NP and is apparently not in P, then the problem seems to always be NP-complete.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Downey, R.G., Fellows, M.R. (1999). The Basic Class W[1] and an Analog of Cook’s Theorem. In: Parameterized Complexity. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0515-9_10
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0515-9_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6798-0
Online ISBN: 978-1-4612-0515-9
eBook Packages: Springer Book Archive