Recomienda este artículo a tus amigos:
Computational Complexity: A Modern Approach Arora, Sanjeev (Princeton University, New Jersey)
Computational Complexity: A Modern Approach
Arora, Sanjeev (Princeton University, New Jersey)
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.
594 pages, 73 b/w illus. 6 tables 307 exercises
| Medios de comunicación | Libros Hardcover Book (Libro con lomo y cubierta duros) |
| Publicado | 20 de abril de 2009 |
| ISBN13 | 9780521424264 |
| Editores | Cambridge University Press |
| Páginas | 594 |
| Dimensiones | 187 × 261 × 39 mm · 1,28 kg |
| Lengua | Inglés |