24小时热门版块排行榜

>论坛更新日志 (4786)
>导师招生 (625)
>文献求助 (389)
>休闲灌水 (239)
>硕博家园 (115)
>考博 (106)
>博后之家 (100)
>招聘信息布告栏 (82)
>公派出国 (81)
>虫友互识 (78)
>论文投稿 (60)
>论文道贺祈福 (47)
>海外博后 (43)
>留学生活 (37)
>基金申请 (33)
>考研 (30)

返回列表

当前只显示满足指定条件的回帖，点击这里查看本话题的所有回帖

zwatchina

金虫 (小有名气)

应助: 2 (幼儿园)
金币: 584.3
红花: 2
帖子: 228
在线: 141.9小时
虫号: 870055
注册: 2009-10-12
性别: GG
专业: 计算机网络

[交流] 【分享】算法（伯克利教科书，Dasgupta等著）【已搜索无重复】已有4人参与

Algorithms
by S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani

Publisher: McGraw-Hill 2006
ISBN/ASIN: 0073523402
ISBN-13: 9780073523408
Number of pages: 336

Description:
This book evolved over the past ten years from a set of lecture notes developed by the authors while teaching the undergraduate Algorithms course at Berkeley and U.C. San Diego. Instead of dwelling on formal proofs, this book distills in each case the crisp mathematical idea that makes the algorithm work. In other words, this book emphasizes rigor over formalism. Undergraduate students in Computer Science should be much more receptive to mathematical rigor of this form.

在线阅读：
http://www.cs.berkeley.edu/~vazirani/algorithms.html

Chapter 0: Prologue
Chapter 1: Algorithms with numbers
Chapter 2: Divide-and-conquer algorithms
Chapter 3: Decompositions of graphs
Chapter 4: Paths in graphs
Chapter 5: Greedy algorithms
Chapter 6: Dynamic programming
Chapter 7: Linear programming
Chapter 8: NP-complete problems
Chapter 9: Coping with NP-completeness
Chapter 10: Quantum algorithms
http://www.cs.berkeley.edu/~vazirani/algorithms/all.pdf

回复此楼