Professor Stephen A. Cook is a pioneer of the theory of computational complexity. His work on NP-completeness and the P vs. NP problem remains a central focus o

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.

The study of the connections between mathematical automata and for mal logic is as old as theoretical computer science itself. In the founding paper of the subj

This volume presents four machine-independent theories of computational complexity, which have been chosen for their intrinsic importance and practical relevanc

In Memory of Dieter Rötting. 24.8.1937 - 4.6.1984. On the Occasion of the 50th Anniversary of His Birth