Computational Complexity: A Modern Approach - Boaz Barak,Sanjeev Arora
-25% koodilla BOOKS
Toimitus 10-16 arkipäivässä
30 päivän palautusoikeus
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.
Saatat myös pitää
Kuvaus
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.
Lisätietoja
| Kirjoittaja | Boaz Barak, Sanjeev Arora |
|---|---|
| Julkaisija | Cambridge University Pr. |
| Julkaisuvuosi | 2009 |
| Kannen tyyppi | Kovakantinen |
| EAN | 9780521424264 |