Computational Complexity: A Modern Approach - Rilegato

Arora, Sanjeev; Barak, Boaz

 
9780521424264: Computational Complexity: A Modern Approach

Sinossi

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

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Informazioni sugli autori

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Altre edizioni note dello stesso titolo

9781316612156: Computational Complexity A Modern Approach

Edizione in evidenza

ISBN 10:  1316612155 ISBN 13:  9781316612156
Brossura