Abstract
We look at several other approaches to coping with intractability. They include approximation algorithms, PTAS’s, average case complexity, smoothed analysis, and generic case complexity. We look at both the positive techniques and the hardness theories.
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). Other Approaches to Coping with Hardness∗. In: Computability and Complexity. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-031-53744-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-031-53744-8_10
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)