Abstract
We look at the X-classes, and give analogues of exponential time, namely the class XP. We report on how FPT is provably (unconditionally) a proper subset of XP. We also prove an XP-completeness result.
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
References
A. Adachi, S. Iwata, T. Kasai, Classes of pebble games and complete problems. SIAM J. Comput. 8(4), 576–586 (1979)
A. Adachi, S. Iwata, T. Kasai, Some combinatorial game problems require Ω(n k) time. J. ACM 31(2), 361–376 (1984)
R. Downey, M. Fellows, Parameterized Complexity. Monographs in Computer Science (Springer, Berlin, 1999)
L. Stockmeyer, A. Chandra, Provably difficult combinatorial games. SIAM J. Comput. 8(2), 151–174 (1979)
L. Stockmeyer, D. Kozen, A. Chandra, Alternation. J. ACM 28, 114–133 (1981)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Downey, R.G., Fellows, M.R. (2013). Provable Intractability: The Class XP. In: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-5559-1_27
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5559-1_27
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5558-4
Online ISBN: 978-1-4471-5559-1
eBook Packages: Computer ScienceComputer Science (R0)