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

A complete treatment of fundamentals and recent advances in complexity theory Complexity theory studies the inherent difficulties of solving algorithmic problem

Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources

This book offers a comprehensive perspective to modern topics in complexity theory, which is a central field of the theoretical foundations of computer science.