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.
- ISBN:
- 9780201530827
- 9780201530827
- Category:
- Mathematical theory of computation
- Format:
- Paperback
- Publication Date:
- 30-11-1993
- Language:
- English
- Publisher:
- Pearson Education (US)
- Country of origin:
- United States
- Pages:
- 544
- Dimensions (mm):
- 246x171x30mm
- Weight:
- 0.86kg
Click 'Notify Me' to get an email alert when this item becomes available
Great!
Click on Save to My Library / Lists
Click on Save to My Library / Lists
Select the List you'd like to categorise as, or add your own
Here you can mark if you have read this book, reading it or want to read
Awesome! You added your first item into your Library
Great! The fun begins.
Click on My Library / My Lists and I will take you there
Click on My Library / My Lists and I will take you there
Reviews
Be the first to review Computational Complexity.
Share This Book: