off

# Computational Complexity : A Modern Approach

US$52.06US$69.36

You save US$17.30

Free delivery worldwide

Available

Dispatched in 1 business day

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.

show more- Hardback | 594 pages
- 182.88 x 254 x 35.56mm | 1,202.01g
- 01 Jun 2009
- CAMBRIDGE UNIVERSITY PRESS
- Cambridge
- English
- 73 b/w illus. 6 tables 307 exercises
- 0521424267
- 9780521424264
- 172,987

## Other books in this category

### Essential Mathematics for Games and Interactive Applications

27 Jun 2008

Hardback

US$57.24 US$67.82

Save US$10.58

## Other people who viewed this bought:

### Finite Element Methods for Computational Fluid Dynamics

01 Jul 2016

Paperback

US$98.79 US$112.54

Save US$13.75

### Estimation with Applications to Tracking and Navigation

10 Jul 2001

Hardback

US$116.94 US$168.05

Save US$51.11

## Author Information

Sanjeev Arora is a Professor in the department of computer science at Princeton University. He holds a Ph.D. from the University of California, Berkeley and has done foundational work in complexity theory, probabilistically checkable proofs, and approximation algorithms. Boaz Barak is an assistant professor in the department of computer science at Princeton University. He holds a Ph.D. from the Weizmann Institute of Science.

show more## Review quote

'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

show more