Computation Complexity Lctn - Laszlo Lovasz

Computation Complexity Lctn - Laszlo Lovasz

ID:39357631

大小:990.23 KB

页数:169页

时间:2019-07-01

Computation Complexity Lctn - Laszlo Lovasz_第1页
Computation Complexity Lctn - Laszlo Lovasz_第2页
Computation Complexity Lctn - Laszlo Lovasz_第3页
Computation Complexity Lctn - Laszlo Lovasz_第4页
Computation Complexity Lctn - Laszlo Lovasz_第5页
资源描述:

《Computation Complexity Lctn - Laszlo Lovasz》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、winxos11-01-28winxos11-01-28ComputationComplexityLaszloLovasztranslation,additions,modi cationsbyPeterGacsMarch15,1994Lecturenotesforaone-semestergraduatecourse.Partofitisalsosuitableforanundergraduatecourse,ataslowerpace.Mathematicalmaturityisthemainprerequisite.Contents1Introduction42Models

2、ofcomputation62.1TheTuringmachine:::::::::::::::::::::::::::::::72.2TheRandomAccessMachine::::::::::::::::::::::::::162.3Booleanfunctionsandlogiccircuits:::::::::::::::::::::::222.4Finite-statemachines:::::::::::::::::::::::::::::::292.5ChurchThesis,andPolynomialChurchThesis:::::::::::::::::332.6A

3、realistic nitecomputer::::::::::::::::::::::::::::333Algorithmicdecidability353.1Recursiveandrecursivelyenumerablelanguages::::::::::::::::353.2Otherundecidableproblems:::::::::::::::::::::::::::403.3Computabilityinlogic::::::::::::::::::::::::::::::464Storageandtime524.1Polynomialtime::::::::::::

4、::::::::::::::::::::::534.2Othertypicalcomplexityclasses:::::::::::::::::::::::::604.3Linearspace::::::::::::::::::::::::::::::::::::624.4Generaltheoremsonspace-andtimecomplexity::::::::::::::::644.5EXPTIME-completeandPSPACE-completegames::::::::::::::704.6Storageversustime::::::::::::::::::::::::

5、::::::::725Non-deterministicalgorithms735.1Non-deterministicTuringmachines:::::::::::::::::::::::735.2Thecomplexityofnon-deterministicalgorithms::::::::::::::::755.3ExamplesoflanguagesinNP::::::::::::::::::::::::::805.4NP-completeness:::::::::::::::::::::::::::::::::885.5FurtherNP-completeproblems

6、:::::::::::::::::::::::::926Randomizedalgorithms1006.1Verifyingapolynomialidentity:::::::::::::::::::::::::1006.2Primetesting:::::::::::::::::::::::::::::::::::1036.3Randomizedcomplexityclasses:::::::::::::::::::::::::1077Informationcomplexity(thecomplexity-theoreticnotionofrandomness)1117.1Inform

7、ationcomplexity::::::::::::::::::::::::::::::1117.2Self-delimitinginformationcomplexity:::::::::::::::::::::1157.3Thenotionofarandomsequence::::::::::::::::::::::::1187.4Kolmogorovcomplexityandentropy::::::::::::

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。