Abstract
For the practical person, demonstrating that a problem is NP-complete is never the end of the line. Presumably, there was a reason why you wanted to solve it in the first place.
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
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Skiena, S. (2020). Dealing with Hard Problems. In: The Algorithm Design Manual. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-54256-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-54256-6_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-54255-9
Online ISBN: 978-3-030-54256-6
eBook Packages: Computer ScienceComputer Science (R0)