購物比價找書網找車網
FindBook  
 有 1 項符合

COMPUTATIONAL COMPLEXITY: A MODERN APPROACH

的圖書
Computational Complexity: A Modern Approach Computational Complexity: A Modern Approach

作者:ARORA 
出版社:全華圖書
出版日期:2009-01-01
語言:繁體中文   規格:精裝 / 608頁 / 普通級/ 單色印刷 / 初版
圖書選購
型式價格供應商所屬目錄
 
$ 1200
三民網路書店 三民網路書店
電腦
圖書介紹 - 資料來源:博客來   評分:
圖書名稱: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.
 

目錄

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.

 

詳細資料

  • ISBN:9780521424264
  • 叢書系列: 實用資訊
  • 規格:精裝 / 608頁 / 普通級 / 單色印刷 / 初版
  • 出版地:台灣
贊助商廣告
 
 
博客來 - 暢銷排行榜
生命中最大的寶藏就是你自己Stand by Yourself
作者:曾寶儀
出版社:天下文化
出版日期:2024-10-31
$ 331 
博客來 - 暢銷排行榜
張忠謀自傳:下冊 一九六四 ── 二〇一八
出版日期:2024-11-29
$ 592 
金石堂 - 暢銷排行榜
失控的焦慮世代:手機餵養的世代,如何面對心理疾病的瘟疫
作者:強納森.海德特
出版社:網路與書
出版日期:2024-11-29
$ 379 
 
Taaze 讀冊生活 - 新書排行榜
【新譯】十二國記-魔性之子
作者:小野不由美
出版社:尖端出版
出版日期:2024-12-20
$ 288 
Taaze 讀冊生活 - 新書排行榜
要是未曾相遇就好了(01)(超過400萬點閱!台灣LINE WEBTOON人氣原創漫畫,影視化進行中)
作者:M蜥
出版社:春光
出版日期:2024-12-05
$ 285 
博客來 - 新書排行榜
我的英雄學院 41 (首刷限定版)
$ 190 
 

©2024 FindBook.com.tw -  購物比價  找書網  找車網  服務條款  隱私權政策