Part of the EATCS Monographs on Theoretical Computer Science Series book series (EATCS, volume 11)


In its most general sense, Complexity Theory encompasses several quite different approaches. All of them have in common two characteristics, which can be considered as a general definition of the field: first, they study algorithms and the problems solved by them; second, they focus on the computational resources required by these algorithms.


Turing Machine Complexity Theory Physical Machine Boolean Circuit Polynomial Time Reduction 
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 Berlin Heidelberg 1988

Authors and Affiliations

  1. 1.Facultat d’InformàticaUniversität Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations