Abstract
In its most general sense, Complexity Theory encompasses several quite different approaches. All of them have in common two characteristics, which can be considered as a general definition of the field: first, they study algorithms and the problems solved by them; second, they focus on the computational resources required by these algorithms.
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
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Balcázar, J.L., Díaz, J., Gabarró, J. (1988). Introduction. In: Structural Complexity I. EATCS Monographs on Theoretical Computer Science Series, vol 11. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-97062-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-97062-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-97064-1
Online ISBN: 978-3-642-97062-7
eBook Packages: Springer Book Archive