点击选择搜索分类
首页 - 法律- 正文
☆☆☆☆☆
||
[美] 阿罗拉 著
出版社: 世界图书出版公司 ISBN:9787510042867 版次:1 商品编码:10975216 包装:平装 外文名称:Computational Complexity 开本:16开 出版时间:2012-03-01 页数:579 正文语种:英文
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
计算复杂性的现代方法 [Computational Complexity] 电子书 下载 mobi epub pdf txt
计算复杂性的现代方法 [Computational Complexity]-so88
计算复杂性的现代方法 [Computational Complexity] pdf epub mobi txt 电子书 下载 2022
图书介绍
☆☆☆☆☆
||
[美] 阿罗拉 著
出版社: 世界图书出版公司 ISBN:9787510042867 版次:1 商品编码:10975216 包装:平装 外文名称:Computational Complexity 开本:16开 出版时间:2012-03-01 页数:579 正文语种:英文
内容简介
《计算复杂性的现代方法》是一部将所有有关复杂度知识理论集于一体的教程。将最新进展和经典结果结合起来,是一部很难得的研究生入门级教程。既是相关科研人员的一部很好的参考书,也是自学人员很难得的一本很好自学教程。本书一开始引入该领域的最基本知识,然后逐步深入,介绍更多深层次的结果,每章末都附有练习。对复杂度感兴趣的人士,物理学家,数学家以及科研人员这本书都是相当受益。目录
About this bOokAcknowledgments
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
前言/序言
计算复杂性的现代方法 [Computational Complexity] 电子书 下载 mobi epub pdf txt
电子书下载地址:
相关电子书推荐:
- 文件名
- WL-常见鸟类野外识别手册-郭冬生 重庆大学出版社 9787562428459
- 走进草原
- 灵光:改变科技进程的20大智慧瞬间
- 男人是傻子,女人是疯子
- 正版程你要知道的世界未解之谜(套装全4册)9787511327598黄澈
- 初等Dirichlet级数和模形式(影印版)/国外数学名著系列72 [Elemetary Dirichlet Series and Modular Forms]
- BF-趣味物理体验书-舒锡莉 中国纺织出版社 9787518025497
- 读有所得-48
- 人类的家园
- 女人那点心思,男人那点德性
- 北京花开:写给大看的植物书 畅销书籍 正版 航天北京花开--写给大看的植物书(珍藏版) 韩
- 应用概率论教程(上册)
- 鱼类-科学奇思妙想
- 儿童青少年与家庭社会工作评论-(第三四辑)
- BF-博物志-【法】布丰 外语教学与研究出版社 9787513589208