Zobacz książki o podobnej tematyce

Powiadomienie o dostępności

Więcej informacji o Computational Complexity

• Dane szczegółowe
• Opis
• Ulubione w innej kategorii

Opis

This text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. 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, the polynomial hierarchy, and many others. Several sophisticated and recent results are presented in a rather simple way, while many more are developed in the form of extensive notes, problems, and hints. The book is surprisingly self-contained, in that it develops all necessary mathematical prerequisites from such diverse fields as computability, logic, number theory, combinatorics and probability.

Szczegóły książki

Kategoria Książki po angielsku Mathematics & science Mathematics Probability & statistics

• Pełny tytuł: Computational Complexity
• Autor: Christo H Papadimitriou
• Język: Angielski
• Oprawa: Miękka
• Liczba stron: 544
• EAN: 9780201530827
• ISBN: 0201530821
• ID: 01290289
• Wydawca: Pearson Education
• Waga: 860 g
• Wymiary: 246 × 171 × 30 mm
• Data wydania: 30. November 1993

Ulubione w innej kategorii

---

---

---