Items related to Computational Complexity: A Modern Approach

Computational Complexity: A Modern Approach - Hardcover

Arora, Sanjeev; Barak, Boaz

 
9780521424264: Computational Complexity: A Modern Approach

Synopsis

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

"synopsis" may belong to another edition of this title.

About the Authors

Sanjeev Arora is a Professor in the department of computer science at Princeton University. He holds a Ph.D. from the University of California, Berkeley and has done foundational work in complexity theory, probabilistically checkable proofs, and approximation algorithms.

Boaz Barak is an assistant professor in the department of computer science at Princeton University. He holds a Ph.D. from the Weizmann Institute of Science.

"About this title" may belong to another edition of this title.