The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems a

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not a

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

This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems. With chapters contributed by leadi

Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to bi