阿羅拉編著的《計算復雜性的現代方法》是一部將所有有關復雜度知識理論集於一體的教程。將*新進展和經典結果結合起來，是一部很難得的研究生入門級教程。既是相關科研人員的一部很好的參考書，也是自學人員很難得的一本很好自學教程。本書一開始引入該領域的*基本知識，然後逐步深入，介紹*多深層次的結果，每章末都附有練習。對復雜度感興趣的人士，物理學家，數學家以及科研人員這本書都是相當受益。

About this bOok
Acknowledgments
Introduction
0 Notational conventions
PARTONE: BASIC COMPLEXITY CLASSES
1 The computational model--and why it doesn't matter
2 NP and NP completeness
3 Diagonalization
4 Space complexity
5 The polynomial hierarchy and alternations
6 Boolean circuits
7 Randomized computation
8 Interactive proofs
9 Cryptography
10 Quantum computation
11 PCP theorem and hardness of approximation: An introduction
PART TWO: LOWER BOUNDS FOR CONCRETE COMPUTATIONAL MODELS
12 Decision trees
13 Communication complexity
14 Circuit lower bounds: Complexity theory's Waterloo
15 Proof complexity
16 Algebraic computation models
PART THREE: ADVANCED TOPICS
17 Complexity of counting
18 Average case complexity: Levin's theory
19 Hardness amplification and error-correcting codes
20 Derandomization
21 Pseudorandom constructions: Expanders and extractors
22 Proofs of PCP theorems and the Fourier transform technique
23 Why are circuit lower bounds so difficult?
Appendix: Mathematical background
Hints and selected exercises
Main theorems and definitions
Bibliography
Index
Complexity class index