计算机复杂性 : 现代方法 = Computational complexity : a modern approach

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. Notational Conventions -- The Computational Model, And Why It Doesn't Matter -- Np And Np Completeness -- Diagonalization -- Space Complexity -- The Polynomial Hierarchy And Alternations -- Boolean Circuits -- Randomized Computation -- Interactive Proofs -- Cryptography -- Quantum Computation -- Pcp Theorem And Hardness Of Approximation : An Introduction -- Decision Trees -- Communication Complexity -- Circuit Lower Bounds : Complexity Theory's Waterloo -- Proof Complexity -- Algebraic Computation Models -- Complexity Of Counting -- Average Case Complexity : Levin's Theory -- Hardness Amplification And Error-correcting Codes -- Derandomization -- Pseudorandom Constructions : Expanders And Extractors -- Proofs Of Pcp Theorems And The Fourier Transform Technique -- Why Are Circuit Lower Bounds So Difficult? Sanjeev Arora, Boaz Barak. Includes Bibliographical References (p. 549-573) And Indexes.