|
|
|
COMPUTATIONAL COMPLEXITY: A MODERN APPROACH
|
|
沒有庫存
訂購需時10-14天
|
|
|
|
|
|
9780521424264 | |
|
|
|
ARORA | |
|
|
|
全華科技 | |
|
|
|
2009年1月01日
| |
|
|
|
400.00 元
| |
|
|
|
HK$ 380
|
|
|
|
|
| |
|
|
|
|
| |
|
|
詳
細
資
料
|
* 叢書系列：實用資訊
* 規格：精裝 / 608頁 / 普級 / 單色印刷 / 初版
* 出版地：台灣
實用資訊
|
|
分
類
|
專業/教科書/政府出版品 > 電機資訊類 > 資訊 |
同
類
書
推
薦
|
|
|
內
容
簡
介
|
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.
|
|
目
錄
|
Part I. Basic Complexity Classes:
Ch 1. The computational model - and why it doesn’t matter
Ch 2. NP and NP completeness
Ch 3. Diagonalization
Ch 4. Space complexity
Ch 5. The polynomial hierarchy and alternations
Ch 6. Boolean circuits
Ch 7. Randomized computation
Ch 8. Interactive proofs
Ch 9. Cryptography
Ch 10. Quantum computation
Ch 11. PCP theorem and hardness of approximation: an introduction
Part II. Lower Bounds for Concrete Computational Models:
Ch 12. Decision trees
Ch 13. Communication complexity
Ch 14. Circuit lower bounds
Ch 15. Proof complexity
Ch 16. Algebraic computation models
Part III. Advanced Topics:
Ch 17. Complexity of counting
Ch 18. Average case complexity: Levin’s theory
Ch 19. Hardness amplification and error correcting codes
Ch 20. Derandomization
Ch 21. Pseudorandom constructions: expanders and extractor
Ch 22. Proofs of PCP theorems and the Fourier transform technique
Ch 23. Why are circuit lower bounds so difficult?Appendix A: mathematical background.
|
|
|
書
評
|
|
|
|
