Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- 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.
- Product Details
- Pdf.epub.mobi 523 pages
- Publisher: Addison-Wesley; 1 edition (December 10, 1993)
- Language: English
- ISBN-10: 0201530821
- ISBN-13: 978-0201530827
- Download Files To RapidGator:
- http://rapidgator.net/folder/2863320/Download_Ebook_Here.html
- Or
- Download Files Zippyshare :
- http://www.zippyshare.com/ebook4download/e2isrsrr/dir.html
Add Comment
Please, Sign In to add comment
