Edition: 1
Release: 1993-12-10
Publisher: Addison-Wesley
Binding: Paperback
ISBN/ASIN: 0201530821
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. Free download Computational Complexity books collection in PDF, EPUB, FB2, MOBI, and TXT formats. A Best deals ebooks download Computational Complexity on amazon.ong 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. Computational Complexity with free ebook downloads available via rapidshare, mediafire, 4shared, and hotfile.
Download Computational Complexity
Tidak ada komentar:
Posting Komentar