This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solid and relevant base of mathematical skills - the skills needed to solve complex problems, to evaluate horrendous sums, and to discover subtle patterns in data. It is an indispensable text and reference not only for computer scientists - the authors themselves rely heavily on it! - but for serious users of mathematics in virtually every discipline. Concrete Mathematics is a blending of CONtinuous and disCRETE mathematics. "More concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems." The subject matter is primarily an expansion of the Mathematical Preliminaries section in Knuth's classic Art of Computer Programming, but the style of presentation is more leisurely, and individual topics are covered more deeply. Several new topics have been added, and the most significant ideas have been traced to their historical roots. The book includes more than 500 exercises, divided into six categories.Complete answers are provided for all exercises, except research problems, making the book particularly valuable for self-study. Major topics include: *Sums *Recurrences *Integer functions *Elementary number theory *Binomial coefficients *Generating functions *Discrete probability *Asymptotic methods This second edition includes important new material about mechanical summation. In response to the widespread use of the first edition as a reference book, the bibliography and index have also been expanded, and additional nontrivial improvements can be found on almost every page. Readers will appreciate the informal style of Concrete Mathematics. Particularly enjoyable are the marginal graffiti contributed by students who have taken courses based on this material. The authors want to convey not only the importance of the techniques presented, but some of the fun in learning and using them. 0201558025B04062001
本书购于本科大四寒假前夕,研究生期间被带到北京,放在实验室的桌上三年未曾翻过。工作之后下决心把它看完,从11年春天到12年春天,除去期间两三个月玩三国志的时间,耗时约一年 认真思考过书中每一道习题,半数以上的题目即使看了答案也不会做。读完最大的收获是自己清醒地...
評分30位读者评价了这条书评,30位认为有价值 [5星评价] 我最喜爱的数学书,毫无疑问 2011.05.16 作者:A Studious Student(一位勤奋好学的学生) 原文:http://www.amazon.com/review/R29RP5TLX8P90K 这是迄今为止我最喜爱的数学书。我在普特南(Putnam)数学竞赛预备课程...
評分我一直认为,评价一本专业书籍,不仅要知道它讲了什么,也要清楚它没讲什么。有了这样的信息,人们才会知道这本书是不是他要的;而且除了这本书他还需要什么。这比仅仅把它作为“经典”而向人推荐,更有帮助。 一本好的专业书不但要清晰的呈现美丽的结果,也要为人们指出通向...
評分30位读者评价了这条书评,30位认为有价值 [5星评价] 我最喜爱的数学书,毫无疑问 2011.05.16 作者:A Studious Student(一位勤奋好学的学生) 原文:http://www.amazon.com/review/R29RP5TLX8P90K 这是迄今为止我最喜爱的数学书。我在普特南(Putnam)数学竞赛预备课程...
評分讲解内容简单易懂,比听课什么的好多了…… 习题难度巨大无比,让我严重怀疑我是否看懂了前面的讲解部分……
algorithm analysis & design
评分algorithm analysis & design
评分must read for all computer science students
评分教科書,老師很厲害,剖析相當到位。這書自己學其實挺難的
评分must read for all computer science students
本站所有內容均為互聯網搜索引擎提供的公開搜索信息,本站不存儲任何數據與內容,任何內容與數據均與本站無關,如有需要請聯繫相關搜索引擎包括但不限於百度,google,bing,sogou 等
© 2025 qciss.net All Rights Reserved. 小哈圖書下載中心 版权所有