Pastāsti draugiem par šo preci:
Computational Complexity Christos Papadimitriou
Computational Complexity
Christos Papadimitriou
Offers a comprehensive treatment of the theory of algorithms and complexity. Among topics covered are: reductions and NP - completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the P=NP question, parallel computation, and more.
500 pages, notes, references
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 1993. gada 30. novembris |
| Oriģinālā izdošanas datums | 1994 |
| ISBN13 | 9780201530827 |
| Izdevēji | Pearson Education (US) |
| Lapas | 544 |
| Izmēri | 171 × 246 × 30 mm · 802 g |
Vairāk no Christos Papadimitriou
Rādīt visuMere med samme udgiver
Skatīt visus Christos Papadimitriou ( piem., Paperback Book )