• Sign In / Register
  • Help
  • Basket0
Computational Complexity: A Modern Approach (Hardback)
  • Computational Complexity: A Modern Approach (Hardback)

Computational Complexity: A Modern Approach (Hardback)

(author), (author)
Hardback 594 Pages / Published: 20/04/2009
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket
This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set. The book starts with a broad introduction to the field and progresses to advanced results. Contents include: definition of Turing machines and basic time and space complexity classes, probabilistic algorithms, interactive proofs, cryptography, quantum computation, lower bounds for concrete computational models (decision trees, communication complexity, constant depth, algebraic and monotone circuits, proof complexity), average-case complexity and hardness amplification, derandomization and pseudorandom constructions, and the PCP theorem.

Publisher: Cambridge University Press
ISBN: 9780521424264
Number of pages: 594
Weight: 2780 g
Dimensions: 253 x 215 x 38 mm

'This book by two leading theoretical computer scientists provides a comprehensive, insightful and mathematically precise overview of computational complexity theory, ranging from early foundational work to emerging areas such as quantum computation and hardness of approximation. It will serve the needs of a wide audience, ranging from experienced researchers to graduate students and ambitious undergraduates seeking an introduction to the mathematical foundations of computer science. I will keep it at my side as a useful reference for my own teaching and research.' Richard M. Karp, University of California at Berkeley
'This text is a major achievement that brings together all of the important developments in complexity theory. Student and researchers alike will find it to be an immensely useful resource.' Michael Sipser, author of Introduction to the Theory of Computation
'Computational complexity theory is at the core of theoretical computer science research. This book contains essentially all of the (many) exciting developments of the last two decades, with high level intuition and detailed technical proofs. It is a must for everyone interested in this field.' Avi Wigderson, Professor, Institute for Advanced Study, Princeton

You may also be interested in...

Bayesian Methods for Hackers
Added to basket
The Lattice Boltzmann Equation
Added to basket
Concrete Mathematics
Added to basket
Numerical Recipes 3rd Edition
Added to basket
The Algorithm Design Manual
Added to basket
Mixed media product
The Elements of Statistical Learning
Added to basket
A First Course in Coding Theory
Added to basket
The End of Error
Added to basket
The Art of Computer Programming
Added to basket
How to Think About Algorithms
Added to basket
MATLAB Demystified
Added to basket
Discrete Mathematics
Added to basket
Foundation Mathematics
Added to basket
Added to basket


Please sign in to write a review

Your review has been submitted successfully.