Basic Results of Complexity Theory

Part of the Texts in Computer Science book series (TCS)


We begin our study of complexity theory by examining the fundamental properties of complexity classes. These results apply to all complexity classes and show that the definitions of these classes are invariant under small changes in the time or space bounds of the Turing machines that define them. We will prove general relationships between time- and space-bounded complexity classes. These consist of inclusions between some classes and separations of other classes. Then we will apply the methods and results of these general relationships to important specific cases in order to establish relationships between the central standard complexity classes we defined in the previous chapter. In order to begin this study we need to understand some simple assertions that involve the behavior of functions at limits, so let’s review these now.


Turing Machine Complexity Class Input Word Deterministic Turing Machine Nondeterministic Turing Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Computer Science DepartmentBoston UniversityBostonUSA
  2. 2.Department of Computer Science and EngineeringUniversity at Buffalo The State University of New YorkBuffaloUSA

Personalised recommendations