Pastāsti draugiem par šo preci:
Computational Complexity: A Modern Approach Arora, Sanjeev (Princeton University, New Jersey)
Do you have a profile? Pierakstīties
Saņemiet paziņojumus par jauniem Arora, Sanjeev (Princeton University, New Jersey) izdevumiem
Mūsu klienti saka:
Pievienot savam iMusic vēlmju sarakstam
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
| Mediji | Grāmatas Hardcover Book (Grāmata ar cieto muguriņu un vāku) |
| Izlaists | 2009. gada 20. aprīlis |
| ISBN13 | 9780521424264 |
| Izdevēji | Cambridge University Press |
| Lapas | 594 |
| Izmēri | 187 × 261 × 39 mm · 1,28 kg |
| Valoda | Angļu |
Vairāk no tā paša izdevēja
Skatīt visus Arora, Sanjeev (Princeton University, New Jersey) ( piem., Hardcover Book )