Classes beyond NP

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


In this chapter we describe classes of complexity which contain the class NP by generalizing the notion of non-deterministic acceptance. We define the polynomial hierarchy PH, included in the class PSPACE.


Turing Machine Computation Tree Universal State Polynomial Hierarchy Probabilistic 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.


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