| Author: |
|
Christos H. Papadimitriou
|
| Title: |
 |
Computational Complexity |
| Moochable copies: |
|
No copies available |
| Amazon suggests: |
|
| Topics: |
|
| Published in: |
|
English |
| Binding: |
|
Paperback |
| Pages: |
|
523 |
| Date: |
|
1993-12-10 |
| ISBN: |
|
0201530821 |
| Publisher: |
|
Addison-Wesley |
| Weight: |
|
1.9 pounds |
| Size: |
|
6.54 x 1.06 x 9.37 inches |
| Edition: |
|
1 |
Amazon prices: |
|
|
| Previous givers: |
|
1 Digital Niels (Denmark) |
| Previous moochers: |
|
1 Bill (USA: CA) |
| Wishlists: |
|
| Description: |
|
Product Description
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.
|
| URL: |
|
http://bookmooch.com/0201530821 |
|
|
