文件名称:algorithms
介绍说明－－下载内容来自于网络，使用问题请自行百度
Algorithms
Copyright c
2006 S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani
July 18, 2006-This book evolved over the past ten years from a set of lecture notes developed while teaching the undergraduate Algorithms course at Berkeley and U.C. San Diego. Our way of teaching this course evolved tremendously over these years in a number of directions, partly to address our students background (undeveloped formal skills outside of programming), and partly to rect the maturing of the eld in general, as we have come to see it. The notes increasingly crystallized into a narrative, and we progressively structured the course to emphasize the “ story line” implicit in the progression of the material. As a result, the topics were carefully selected and clustered. No attempt was made to be encyclopedic, and this freed us to include topics traditionally de-emphasized or omitted from most Algorithms books.
Copyright c
2006 S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani
July 18, 2006-This book evolved over the past ten years from a set of lecture notes developed while teaching the undergraduate Algorithms course at Berkeley and U.C. San Diego. Our way of teaching this course evolved tremendously over these years in a number of directions, partly to address our students background (undeveloped formal skills outside of programming), and partly to rect the maturing of the eld in general, as we have come to see it. The notes increasingly crystallized into a narrative, and we progressively structured the course to emphasize the “ story line” implicit in the progression of the material. As a result, the topics were carefully selected and clustered. No attempt was made to be encyclopedic, and this freed us to include topics traditionally de-emphasized or omitted from most Algorithms books.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
algorithms.pdf
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。