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...
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
By the way, there's a mnemonic for remembering which case uses floors and which uses ceilings: Half-open intervals that include the left endpoint but not the right (such as 0 ≤ θ < 1) are slightly more common than those that include the right endpoint but not the left; and floors are slightly more common than ceilings. So by Murphy's Law, the correct rule is the opposite of what we'd expect -- ceilings for [α..β) and floors for (α..β]. (查看原文)
(摘自本人博客:http://blog.zhenghui.org/2013/07/24/magic-of-math/ 或:http://en.zhenghui.org/2013/05/18/magic-of-math_CN/) 人民邮电出版社出版的《具体数学——计算机科学基础》译自经典名著 《Concrete Mathematics: A Foundation for Computer Science》。 简单地...
(展开)
1 有用 F | Wagon 2019-01-20 20:50:40
补
1 有用 这么早就回忆了 2009-08-29 05:42:42
algorithm analysis & design
1 有用 (+/21_4 2014-01-12 09:38:44
对于我来说这本书是件艺术品 很漂亮
1 有用 驴打滚 2022-08-27 16:11:06 天津
这遍读完我有点激动,哪天有空写点吧。温馨提示:不做习题等于白看。
1 有用 男儿何不带吴钩 2011-03-26 22:37:19
所有学计算机科学和工程的都应该读一读。