Computational Complexity Hardback: A Modern Approach - Tapa dura

Arora; Barak

 
9780521424264: Computational Complexity Hardback: A Modern Approach
Tapa dura
ISBN 10: 0521424267 ISBN 13: 9780521424264
Editorial: Cambridge University Press, 2009

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.

Editorial
Cambridge University Press
Año de publicación
2009
Idioma
Inglés
ISBN 10 
0521424267
ISBN 13 
9780521424264
Encuadernación
Tapa dura
Número de edición
1
Número de páginas
594
Contacto del fabricante
Cambridge University Press
https://www.cambridge.org/

Via Honduras,15
Pomezia
Italia
71
Italia

Otras ediciones populares con el mismo título

9781316612156: Computational Complexity A Modern Approach

Edición Destacada

ISBN 10:  1316612155 ISBN 13:  9781316612156
Editorial: SANJEEV ARORA, 2017
Tapa blanda