Portada

COMPUTABILITY AND COMPLEXITY THEORY IBD

SPRINGER
12 / 2011
9781461406815
Inglés

Sinopse

Preliminaries.- Introduction to Computability.- Undecidability.- Introduction to Complexity Theory.- Basic Results of Complexity Theory.- Nondeterminism and NP-Completeness.- Relative Computability.- Nonuniform Complexity.- Parallelism.- Probabilistic Complexity Classes.- Introduction to Counting Classes.- Interactive Proof Systems.- References.- Author Index.- Subject Index.

PVP
132,44