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

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

Starting with Cook's pioneering work on NP-completeness in 1970, polynomial complexity theory, the study of polynomial-time com putability, has quickly emerged

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

This volume contains the proceedings of the Stanford Symposium on Algebraic Topology: Applications and New Directions, held from July 23-27, 2012, at Stanford U