Computational Complexity
Product Description
Computational Complexity
This modern introduction to the Theory of Computer Science is the first unified introduction to Computational Complexity. I+ 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 pe@ormance and limitations of computer algorithms. The book is self-contained in that it develops all necessary mathematical prerequisites from such diverse fields such as computability, logic, number theory and probability.
Technical Specifications
You might also like
Computational Complexity: A Modern Approach
Introduction to Graph Theory (Dover Books on Mathematics)
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Deep Learning (Adaptive Computation and Machine Learning series)
Introduction to Algorithms, 3rd Edition (MIT Press)
Introduction to the Theory of Computation
Approximation Algorithms
Network Flows: Theory, Algorithms, and Applications
Pattern Recognition and Machine Learning (Information Science and Statistics)
The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Second Edition (Springer Series in Statistics)