Computational Complexity A Modern Approach

Name: Computational Complexity
ISBN: 9780521424264

Sanjeev Arora, Boaz Barak — 2009

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

In print

Bookshop.orgAmazonBook OutletWorld of BooksScholastic

Ebook

KoboAmazon

Audiobook

Libro.fmAudiobooks.com

Library

Find at your library

We may earn a commission. Learn more.

No reviews yet.
Be the first to write one.

No highlights yet.
Be the first to share one.