Artículos relacionados a Computational Complexity Hardback: A Modern Approach

Computational Complexity Hardback: A Modern Approach - Tapa dura

Arora; Barak

 
9780521424264: Computational Complexity Hardback: A Modern Approach

Sinopsis

Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included.

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca de los autores

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.

"Sobre este título" puede pertenecer a otra edición de este libro.