Basics in Discrete Complexity Theory

  • Ker-I Ko
Part of the Progress in Theoretical Computer Science book series (PTCS)


In this chapter we give the formal definitions and basic results of discrete complexity theory, in particular, regarding the complexity classes between logarithmic space and exponential space. Some results on complexity classes of sparse sets and tally sets are included because they are closely related to the structure of the representations of real numbers under our formal definition. Other results in discrete complexity theory, not directly related to our theory, will be introduced in later chapters when they are needed. This chapter is not intended to be an introductory reading for discrete complexity theory. Many important issues in the theory are omitted and most theorems are given without proofs. The reader who wishes to learn more systematically about complexity theory is referred to Garey and Johnson [1979] and Balcázar, Diaz and Gabarró [1988, 1990].


Tape Head Deterministic Turing Machine Nondeterministic Turing Machine Oracle Machine Oracle Function 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Boston 1991

Authors and Affiliations

  • Ker-I Ko
    • 1
  1. 1.Department of Computer ScienceState University of New York at Stony BrookStony BrookUSA

Personalised recommendations