Abstract
In Section 2.3.3 we learned that one does not have any chance to use algorithms of exponential complexity on large input instances because the execution of many, for instance 2100 elementary operations lies beyond the physical reality. Assuming P ≠ NP, there is no possibility to design polynomial-time (deterministic) algorithms for solving NP-hard problems. The question is what can be done if one wants to attack NP-hard problems with deterministic algorithms in practice. In this chapter we consider the following three approaches:
“As gravity is the essential quality of matter, freedom is the basic quality of the spirit. Human freedom is, first of all, the freedom to perform creative work.”
Georg Wilhelm Friedrich Hegel
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hromkovič, J. (2004). Deterministic Approaches. In: Algorithmics for Hard Problems. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05269-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-05269-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07909-2
Online ISBN: 978-3-662-05269-3
eBook Packages: Springer Book Archive