algorithms and complexity - wilf

algorithms and complexity - wilf

ID:14320258

大小:1.29 MB

页数:144页

时间:2018-07-27

algorithms and complexity - wilf_第1页
algorithms and complexity - wilf_第2页
algorithms and complexity - wilf_第3页
algorithms and complexity - wilf_第4页
algorithms and complexity - wilf_第5页
资源描述:

《algorithms and complexity - wilf》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、AlgorithmsandComplexityHerbertS.WilfUniversityofPennsylvaniaPhiladelphia,PA19104-6395CopyrightNoticeCopyright1994byHerbertS.Wilf.Thismaterialmaybereproducedforanyeducationalpurpose,multiplecopiesmaybemadeforclasses,etc.Charges,ifany,forreproducedcopiesmustbejustenoughtorecoverreasonablecostsof

2、reproduction.Reproductionforcommercialpurposesisprohibited.Thiscoverpagemustbeincludedinalldistributedcopies.InternetEdition,Summer,1994ThiseditionofAlgorithmsandComplexityisthe¯lepub/wilf/AlgComp.ps.Z"attheanonymousftpsiteftp.cis.upenn.edu".Itmaybetakenatnochargebyallinterestedpersons.Comme

3、ntsandcorrectionsarewelcome,andshouldbesenttowilf@central.cis.upenn.eduCONTENTSChapter0:WhatThisBookIsAbout0.1Background......................................10.2Hardvs.easyproblems.................................20.3Apreview.......................................4Chapter1:MathematicalPrelimi

4、naries1.1Ordersofmagnitude..................................51.2Positionalnumbersystems...............................111.3Manipulationswithseries...............................141.4Recurrencerelations..................................161.5Counting......................................211.6Gra

5、phs.......................................24Chapter2:RecursiveAlgorithms2.1Introduction.....................................302.2Quicksort......................................312.3Recursivegraphalgorithms...............................382.4Fastmatrixmultiplication.............................

6、..472.5ThediscreteFouriertransform.............................502.6ApplicationsoftheFFT................................562.7Areview.......................................60Chapter3:TheNetworkFlowProblem3.1Introduction.....................................633.2Algorithmsforthenetwork°owproblem.

7、........................643.3ThealgorithmofFordandFulkerson..........................653.4Themax-°owmin-cuttheorem.............................693.5ThecomplexityoftheFord-Fulkersonalgorithm.....................703.6Layerednetworks......

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

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

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