Abstract
We look at the basics of parameterized complexity. This is a method which seeks to find tractability by limiting some parameter in the input. We analyse methods for proving parameterized tractability and also give some basic results the completeness and hardness theory. We also look at limitations of the methods and XP-optimality. The latter gives methods for proving various algorithms are more or less optimal, subject to complexity considerations.
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
Corresponding author
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Downey, R. (2024). Parameterized Complexity. In: Computability and Complexity. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-031-53744-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-031-53744-8_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-53743-1
Online ISBN: 978-3-031-53744-8
eBook Packages: Computer ScienceComputer Science (R0)