Advertisement

Space complexity: the classes L, FL, NL and PSPACE

  • Richard Lassaigne
  • Michel de Rougemont
Part of the Discrete Mathematics and Theoretical Computer Science book series (DISCMATH)

Abstract

In this chapter we describe new complexity classes by imposing constraints on the space used by a machine:
  • • L (also noted LOGSPACE) the class of problems decidable in deterministic logarithmic space,

  • • NL (or NLOGSPACE) the class of problems decidable in non-deterministic logarithmic space,

  • • FL the class of the functions computable in logarithmic space,

  • • PSPACE the class of problems decidable in polynomial space.

Keywords

Polynomial Time Turing Machine Transitive Closure Parallel Time Order Formula 
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 London 2004

Authors and Affiliations

  • Richard Lassaigne
    • 1
  • Michel de Rougemont
    • 2
  1. 1.Maitre de ConferencesUniversity Paris VIIFrance
  2. 2.University Paris IIFrance

Personalised recommendations