Computational Complexity A Modern Approach - Sanjeev Arora

Computational Complexity A Modern Approach - Sanjeev Arora

ID:39357632

大小:4.07 MB

页数:562页

时间:2019-07-01

Computational Complexity A Modern Approach - Sanjeev Arora_第页
预览图正在加载中,预计需要20秒,请耐心等待
资源描述:

《Computational Complexity A Modern Approach - Sanjeev Arora》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、winxos11-01-28winxos11-01-28iComputationalComplexity:AModernApproachDraftofabook:DatedAugust2006Commentswelcome!SanjeevAroraandBoazBarakPrincetonUniversitycomplexitybook@gmail.comNottobereproducedordistributedwithouttheauthor’spermissionSomechaptersaremorefinishedthanothers.Referencesan

2、dattributionsareverypreliminaryandweapologizeinadvanceforanyomissions(buthopeyouwillneverthelesspointthemouttous).DRAFTiiDRAFTAboutthisbookComputationalcomplexitytheoryhasdevelopedrapidlyinthepastthreedecades.Thelistofsurprisingandfundamentalresultsprovedsince1990alonecouldfillabook:the

3、seincludenewprobabilisticdefinitionsofclassi-calcomplexityclasses(IP=PSPACEandthePCPTheorems)andtheirimplicationsforthefieldofapproximationalgorithms;Shor’salgorithmtofactorintegersusingaquantumcomputer;anunderstandingofwhycurrentapproachestothefamousPversusNPwillnotbesuccessful;atheoryo

4、fde-randomizationandpseudorandomnessbaseduponcomputationalhardness;andbeautifulconstructionsofpseudorandomobjectssuchasextractorsandexpanders.Thisbookaimstodescribesuchrecentachievementsofcomplexitythe-oryinthecontextoftheclassicalresults.Itisintendedtobeatextandaswellasareferenceforse

5、lf-study.Thismeansitmustsimultaneouslycatertomanyaudiences,anditiscarefullydesignedwiththatgoal.Through-outthebookweexplainthecontextinwhichacertainnotionisuseful,andwhythingsaredefinedinacertainway.Examplesandsolvedexercisesaccompanykeydefinitions.Thebookhasthreepartsandanappendix.PartI

6、:Basiccomplexityclasses:Thispartprovidesabroadintroduc-tiontothefieldandcoversbasicallythesamegroundasPapadim-itriou’stextfromtheearly1990s—butmorequickly.Itmaybesuit-ableforanundergraduatecoursethatisanalternativetothemoretraditionalTheoryofComputationcoursecurrentlytaughtinmostcompute

7、rsciencedepartments(andexemplifiedbySipser’sexcellentbookwiththesamename).Weassumeessentiallynocomputationalbackground(thoughaslightexposuretocomputingmayhelp)andverylittlemathematicalback-groundapartfromtheabilitytounderstandproofsandsomeelemen-taryprobabilityonfinitesamplespaces.Atyp

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

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

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