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 也许,这本书是我读过的写得最精美的书籍之一。书中呈现的证明皆简练。当你阅读书...
评分Concrete mathematics is Eulerian mathematics! 作者写这本书的目的已经在前言部分的第二段交待得很清楚了,这是一种矫正,一种对abstract偏执的一种矫正,工程师必备的一种素质
评分很多人估计想知道关于这本书的两个问题: 1. 这本书在讲什么? 2. 我为什么要读这本书? == 具体数学在讲什么 == 数学中始终有一种趋势,就是哪位神人发明了一种全新的数学(结构),依靠这种"新"数学,以前的属于此类的高难度问题轻而易举被扫除,其轻易程度甚至可以使用计算...
评分我在06年的时候买的这本书,买的时候并没有参考别人的书评,只是觉得这本书的标题很酷,那时才工作2年,也曾经静下心来花了几个月的时间去学习,但是发现与每天的编码工作没有太大的关系,更重要的是想读懂这本书绝对不是易事,后来就放在书架上。 时间一晃过去了3年,随着经验...
对于我来说这本书是件艺术品 很漂亮
评分must read for all computer science students
评分这大概是15151/251的难度?学完21127看这本还是觉得很奇妙
评分这大概是15151/251的难度?学完21127看这本还是觉得很奇妙
评分不用我多说吧。
本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度,google,bing,sogou 等
© 2025 book.wenda123.org All Rights Reserved. 图书目录大全 版权所有