Product Information
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.Product Identifiers
PublisherCambridge University Press
ISBN-139780521424264
eBay Product ID (ePID)90730476
Product Key Features
Number of Pages594 Pages
LanguageEnglish
Publication NameComputational Complexity: a Modern Approach
Publication Year2009
SubjectComputer Science
TypeTextbook
AuthorSanjeev Arora, Boaz Barak
FormatHardcover
Dimensions
Item Height259 mm
Item Weight2780 g
Additional Product Features
Country/Region of ManufactureUnited Kingdom
Title_AuthorSanjeev Arora, Boaz Barak