Computational Complexity Review
Computational Complexity Overview
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.Available at Amazon Check Price Now!
Related Products
- Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
- Computational Complexity: A Modern Approach
- Introduction to Automata Theory, Languages, and Computation (3rd Edition)
- Combinatorial Optimization: Algorithms and Complexity
- Introduction to Algorithms, Third Edition
Customer Reviews
*** Product Information and Prices Stored: Apr 26, 2011 15:55:16
No comments:
Post a Comment