Abstract
In Chap. 4, we showed that known parameterized complexity classes such as \(\text {para}\text {-}\text {NP}\) and \(\text {para}\text {-}\text {co-}\text {NP}\) can be used to characterize many-to-one fpt-reductions to SAT and UNSAT.
If I had an hour to solve a problem, I’d spend 55 minutes thinking about the problem and 5 minutes thinking about solutions.
— Albert Einstein
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). The Need for a New Completeness 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_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-60670-4_5
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)