Advertisement

Time and Space Bounded Computations

  • José Luis Balcázar
  • Josep Díaz
  • Joaquim Gabarró
Part of the EATCS Monographs on Theoretical Computer Science Series book series (EATCS, volume 11)

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.

Keywords

Turing Machine Tape Head Deterministic Turing Machine Tape Cell 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • José Luis Balcázar
    • 1
  • Josep Díaz
    • 1
  • Joaquim Gabarró
    • 1
  1. 1.Facultat d’InformàticaUniversität Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations