Computational Complexity: A Modern Approach - Boaz Barak,Sanjeev Arora
-40% koodiga BOOKS
Saadetis 10-16 tööpäeva jooksul
30-päevane tagastamisõigus
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.
Võib-olla meeldib sulle ka
Kirjeldus
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.
Lisateave
| Autor | Boaz Barak, Sanjeev Arora |
|---|---|
| Kirjastaja | Cambridge University Pr. |
| Väljalaskeaasta | 2009 |
| Kaanetüüp | Kõvakaaneline |
| EAN | 9780521424264 |