Abstract
In this chapter, we use parameterized reductions and W[1]-hardness to provide evidence that certain parameterized problems are unlikely to be fixed parameter tractable.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Cygan, M. et al. (2015). Fixed-parameter intractability. In: Parameterized Algorithms. Springer, Cham. https://doi.org/10.1007/978-3-319-21275-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-21275-3_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21274-6
Online ISBN: 978-3-319-21275-3
eBook Packages: Computer ScienceComputer Science (R0)