Advertisement

Central Complexity Classes

  • 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 this chapter we present some of the ground work for the following chapters. We define the basic concepts of complexity theory, and prove the basic facts about them. Most of the concepts and results can be found in some other textbooks, although several proofs are presented in a different form. A substantial part of the remaining chapters will depend heavily on the notation and the results presented in this one.

Keywords

Polynomial Time Turing Machine Complexity Class Conjunctive Normal Form Boolean 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 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