Povej prijatelju o tem izdelku:
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
| Medij | Knjige Paperback Book (Knjiga z mehkimi platnicami in lepljenim hrbtom) |
| Izdano | 30. novembra 1993 |
| Prvotni datum izida | 1994 |
| ISBN13 | 9780201530827 |
| Založniki | Pearson Education (US) |
| Strani | 544 |
| Dimenzije | 171 × 246 × 30 mm · 802 g |
Več od Christos Papadimitriou
Prikaži vseMere med samme udgiver
Ogled vseh Christos Papadimitriou ( Na primer Paperback Book )