Abstract
We present here, in a survey style, the basic concepts and theorems about complexity classes. These classes are defined by imposing bounds on the time and the space used by the different models of Turing machines. Remember once more that the aim of this book is the study of structural properties of sets and classes of sets, and that these first two chapters are included for the sake of completeness. Readers interested in pursuing the specific topics treated in these two chapters are referred to the books indicated in the bibliographical remarks.
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
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). Time and Space Bounded Computations. 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_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-97062-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-97064-1
Online ISBN: 978-3-642-97062-7
eBook Packages: Springer Book Archive