Abstract
The remaining chapters of this book are concerned with complexity theory. The goal of complexity theory is to provide mechanisms for classifying combinatorial problems and measuring the computational resources necessary to solve them. Complexity theory provides an explanation of why certain problems have no practical solutions and provides a way of anticipating difficulties involved in solving problems of certain types. The classification is quantitative and is intended to investigate what resources are necessary (lower bounds) and what resources are sufficient (upper bounds) to solve various problems.
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
Notes
- 1.
All logarithms in this book are binary.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Homer, S., Selman, A.L. (2011). Introduction to Complexity Theory. In: Computability and Complexity Theory. Texts in Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-0682-2_4
Download citation
DOI: https://doi.org/10.1007/978-1-4614-0682-2_4
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-0681-5
Online ISBN: 978-1-4614-0682-2
eBook Packages: Computer ScienceComputer Science (R0)