Advertisement

The Polynomial Time Hierarchy

  • 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

In the previous chapter, we have seen that under the hypothesis P ≠ NP there are “hierarchies” of incomparable sets between P and the NP-complete sets. In this section we are going to study a very different kind of hierarchy between P and PSPACE: the polynomial time hierarchy.

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