Bemærk: Kan ikke leveres før jul.
Forventes på lager: 20-04-2009
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.
| Forlag | Cambridge University Press |
| Forfattere | Sanjeev (Princeton University Arora, Boaz (Princeton University Barak |
| Type | Bog |
| Format | Hardback |
| Sprog | Engelsk |
| Udgivelsesdato | 20-04-2009 |
| Første udgivelsesår | 2009 |
| Illustrationer | Worked examples or Exercises; 6 Tables, unspecified; 1 Halftones, unspecified; 72 Line drawings, unspecified |
| Originalsprog | United Kingdom |
| Sideantal | 594 |
| Indbinding | Hardback |
| Forlag | Cambridge University Press |
| Sideoplysninger | 594 pages, Worked examples or Exercises; 6 Tables, unspecified; 1 Halftones, unspecified; 72 Line dr |
| Mål | 260 x 184 x 37 |
| ISBN-13 / EAN-13 | 9780521424264 |