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
我在06年的时候买的这本书,买的时候并没有参考别人的书评,只是觉得这本书的标题很酷,那时才工作2年,也曾经静下心来花了几个月的时间去学习,但是发现与每天的编码工作没有太大的关系,更重要的是想读懂这本书绝对不是易事,后来就放在书架上。 时间一晃过去了3年,随着经验...
评分讲解内容简单易懂,比听课什么的好多了…… 习题难度巨大无比,让我严重怀疑我是否看懂了前面的讲解部分……
评分57位读者评价了这条书评,57位认为有价值 [5星评价] 我希望每本书都这样写! 2005.12.13 作者:Anthony Widjaja To (Toronto, ON Canada) 原文:http://www.amazon.com/review/R1FPDV23KP8IQE 也许,这本书是我读过的写得最精美的书籍之一。书中呈现的证明皆简练。当你阅读书...
评分本书购于本科大四寒假前夕,研究生期间被带到北京,放在实验室的桌上三年未曾翻过。工作之后下决心把它看完,从11年春天到12年春天,除去期间两三个月玩三国志的时间,耗时约一年 认真思考过书中每一道习题,半数以上的题目即使看了答案也不会做。读完最大的收获是自己清醒地...
评分我在06年的时候买的这本书,买的时候并没有参考别人的书评,只是觉得这本书的标题很酷,那时才工作2年,也曾经静下心来花了几个月的时间去学习,但是发现与每天的编码工作没有太大的关系,更重要的是想读懂这本书绝对不是易事,后来就放在书架上。 时间一晃过去了3年,随着经验...
algorithm analysis & design
评分对于我来说这本书是件艺术品 很漂亮
评分不用我多说吧。 @2011-04-24 12:44:19
评分读TAOCP前的数学准备。不难,有趣,幽默,需要的只是时间和耐心。
评分不用我多说吧。 @2011-04-24 12:44:19
本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度,google,bing,sogou 等
© 2025 book.wenda123.org All Rights Reserved. 图书目录大全 版权所有