- 作 者：
- 出 版 社：ADDISON-WESLEY PUBLISHING COMPANY
- 出版年份：1987
- ISBN：0201192403
- 标注页数：425 页
- PDF页数：438 页
请阅读订购服务说明与试读!
订购服务说明
1、本站所有的书默认都是PDF格式，该格式图书只能阅读和打印，不能再次编辑。
2、除分上下册或者多册的情况下，一般PDF页数一定要大于标注页数才建议下单购买。【本资源438 ≥425页】
图书下载及付费说明
1、所有的电子图书为PDF格式，支持电脑、手机、平板等各类电子设备阅读；可以任意拷贝文件到不同的阅读设备里进行阅读。
2、电子图书在提交订单后一般半小时内处理完成,最晚48小时内处理完成。(非工作日购买会延迟)
3、所有的电子图书都是原书直接扫描方式制作而成。
PART ONE PRELIMINARIES 3
1.Introduction and Historical Review OR What’s It All About？ 3
2.Algorithms and Data OR Getting It Done 19
3.Programming Languages OR Getting It Done by Computer 50
PART TWO METHODS AND ANALYSIS 79
4.Algorithmic Methods OR Getting It Done Methodically 79
5.The Correctness of Algorithms OR Getting It Done Right 91
6.The Efficiency of Algorithms OR Getting It Done Cheaply 119
PART THREE LIMITATIONS AND ROBUSTNESS 151
7.Inefficiency and Intractability OR You Can’t Always Get It Done Cheaply 151
8.Noncomputability and Undecidability OR Sometimes You Can’t Get It Done at All！ 184
9.Algorithmic Universality and Its Robustness OR The Simplest Machines that Get It Done 210
PART FOUR RELAXING THE RULES 257
10.Parallelism and Concurrency OR Getting It Done by Cooperating 257
11.Probabilistic Algorithms OR Getting It Done by Tossing Coins 302
12.Algorithmics and Intelligence OR Are They Better at It than Us？ 333
Postscript 355
Bibliographic Notes 357
Index 405