文件名称:
gems of theoretical computer science
开发工具:
文件大小: 1mb
下载次数: 0
上传时间: 2012-11-18
详细说明： Table of Contents Fundamental Definitions and Results 1 1 The Priority Method 9 2 Hilbert's Tenth Problem 15 3 The Equivalence Problem for LOOP(1)- and LOOP(2)-Programs 25 4 The Second LBA Problem 37 5 LOGSPACE, Random Walks on Graphs, and Universal Traversal Sequences 41 6 Exponential Lower Bounds for the Length of Resolution Proofs 49 7 Spectral Problems and Descriptive Complexity Theory 61 8 Kolmogorov Complexity, the Universal Distribution, and Worst-Case vs. Average-Case 71 9 Lower Bounds via Kolmogorov Complexity 77 10 PA C-Learning and Occam's Razor 85 11 Lower Bounds for the Parity Function 91 12 The Parity Function Again 101 13 The Complexity of Craig Interpolants 111 14 Equivalence Problems and Lower Bounds for Branching Programs 115 15 The Berman-Hartmanis Conjecture and Sparse Sets 123 16 Collapsing Hierarchies 131 17 Probabilistic Algorithms, Probability Amplification, and the Recycling of Random Numbers 141 18 The BP-Operator and Graph Isomorphism 153 19 The BP-Operator and the Power of Counting Classes 163 20 Interactive Proofs and Zero Knowledge 175 21 IP = PSPACE 183 22 P does not equal NP with probability 1 191 23 Superconcentrators and the Marriage Theorem 197 24 The Pebble Game 203 25 Average-Case Complexity 213 26 Quantum Search Algorithms 223 Solutions 237 Bibliography 317 Index 321 ...展开收缩
(系统自动生成,下载前可以参看下载内容)
下载文件列表
相关说明
- 本站资源为会员上传分享交流与学习,如有侵犯您的权益,请联系我们删除.
- 本站是交换下载平台，提供交流渠道，下载内容来自于网络，除下载问题外，其它问题请自行百度。
- 本站已设置防盗链，请勿用迅雷、QQ旋风等多线程下载软件下载资源，下载后用WinRAR最新版进行解压.
- 如果您发现内容无法下载，请稍后再次尝试；或者到消费记录里找到下载记录反馈给我们.
- 下载后发现下载的内容跟说明不相乎，请到消费记录里找到下载记录反馈给我们，经确认后退回积分.
- 如下载前有疑问，可以通过点击"提供者"的名字，查看对方的联系方式，联系对方咨询.
