Nonuniform Complexity

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


The complexity measures and the classes introduced so far are intrinsically algorithmic. Our interest is in the amount of resources used by the algorithms solving the problems. But any finite set can be recognized in constant time and zero work space by a deterministic finite automaton; therefore, measuring the amount of resources is meaningless when considering only finite sets. The “intrinsically algorithmic” approach makes sense only when dealing with infinite sets.


Boolean Function Turing Machine Polynomial Size Boolean Circuit Advice Function 
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