Abstract
We have seen many classes that are apparently different from FPT, but as with classical complexity theory, we have no proof of this fact. Moving further along, we might seek classes that are provably distinct from FPT, along the lines that EXP ≠ P. We will briefly look at one such class in this section.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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). Provable Intractability: The Class X P. In: Parameterized Complexity. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0515-9_15
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0515-9_15
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