Abstract
Practical experience shows that some computational problems are easier to solve than others. Complexity theory provides a mathematical framework in which computational problems are studied so that they can be classified as “easy” or “hard”. In this chapter we will describe the main points of such a theory. A more rigorous presentation can be found in the fundamental book of Garey & Johnson [1979].
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
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Brucker, P. (1995). Computational Complexity. In: Scheduling Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03088-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-03088-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-03090-5
Online ISBN: 978-3-662-03088-2
eBook Packages: Springer Book Archive