Complexity of Algorithms Lctn - Peter Gacs

Complexity of Algorithms Lctn - Peter Gacs

ID:39357573

大小:822.07 KB

页数:180页

时间:2019-07-01

Complexity of Algorithms Lctn -  Peter Gacs_第1页
Complexity of Algorithms Lctn -  Peter Gacs_第2页
Complexity of Algorithms Lctn -  Peter Gacs_第3页
Complexity of Algorithms Lctn -  Peter Gacs_第4页
Complexity of Algorithms Lctn -  Peter Gacs_第5页
资源描述:

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

1、winxos11-01-28winxos11-01-28ComplexityofAlgorithmsLectureNotes,Spring1999PeterG´acsBostonUniversityandL´aszl´oLov´aszYaleUniversity1Contents0IntroductionandPreliminaries10.1Thesubjectofcomplexitytheory...........................10.2Somenotationanddefinitions.............................21ModelsofC

2、omputation31.1Introduction.......................................31.2Finiteautomata....................................51.3TheTuringmachine..................................81.4TheRandomAccessMachine.............................181.5BooleanfunctionsandBooleancircuits........................242Alg

3、orithmicdecidability312.1Introduction.......................................312.2Recursiveandrecursivelyenumerablelanguages...................332.3Otherundecidableproblems..............................372.4Computabilityinlogic.................................423Computationwithresourcebounds503.1I

4、ntroduction.......................................503.2Timeandspace.....................................503.3PolynomialtimeI:Algorithmsinarithmetic.....................523.4PolynomialtimeII:Graphalgorithms........................573.5Polynomialspace....................................624Generalth

5、eoremsonspaceandtimecomplexity654.1Spaceversustime....................................715Non-deterministicalgorithms725.1Non-deterministicTuringmachines..........................725.2Witnessesandthecomplexityofnon-deterministicalgorithms...........745.3Generalresultsonnondeterministiccomplexitycl

6、asses...............765.4ExamplesoflanguagesinNP.............................795.5NP-completeness....................................855.6FurtherNP-completeproblems............................896Randomizedalgorithms996.1Introduction.......................................996.2Verifyingapolynomiali

7、dentity............................996.3Primetesting......................................1036.4Randomizedcomplexityclasses............................10827Informationcomplexity:thecomplexity-theoreticnotionofrandomnes

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

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

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