Computational Complexity

Author: Christos, H. Papadimitriou
Edition:
Binding: Hardcover
ISBN: 0020153082

Computational Complexity

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. Get Computational Complexity computer books for free.
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, Check Computational Complexity our best computer books for 2013. All books are available in pdf format and downloadable from rapidshare, 4shared, and mediafire.

Computational Complexity Free

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 The book is surprisingly self-contained,

Related Computer Books