Computational Complexity
A Modern Approach
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.
Specificaties
| ISBN/EAN | 9780521424264 |
| Auteur | Sanjeev (Princeton University Arora |
| Uitgever | Van Ditmar Boekenimport B.V. |
| Taal | Engels |
| Uitvoering | Gebonden in harde band |
| Pagina's | 594 |
| Lengte | 261.0 mm |
| Breedte | 180.0 mm |