| View Larger Image | Concrete Mathematics: A Foundation for Computer Science (2nd Edition) | Hardcoverby Ronald L. Graham (Author), Donald E. Knuth (Author), Oren Patashnik (Author)
| List Price: | $79.99 | |
| | Binding: | Hardcover | | Publisher: | Addison-Wesley Professional | | Edition: | 2nd Edition | | Page Count: | 672 Pages | | Publication Date: | March 10, 1994 | | Sales Rank: | 98,677th |
|
EDITORIAL REVIEWS |
Product Description
This book, updated and improved, introduces the mathematics that support advanced computer programming and the analysis of algorithms. The book's primary aim is to provide a solid and relevant base of mathematical skills. It is an indispensable text and reference for computer scientists and serious programmers in virtually every discipline. |
CUSTOMER REVIEWS (Average Customer Rating: 4.5 based on 30 reviews)
|
Actually delivers in a readable way by R. Bagula (Lakeside, Ca United States)  4 Stars
March 22, 2009
After having had a bad result from other Ronald L. Graham, Erdos on Graphs : His Legacy of Unsolved Problems, books and articles. I was surprised with this book. I think that Dr. Knuth seems to turn what he touches to gold? I kind of wish I had read this one several years ago when
I wasn't as familiar with the material.
I was amazed to find the recursion for the Eulerian numbers of the second type and a host of very useful identities as well.
| |
Great, great math book ... by Pat Choi (L.A., CA United States)  5 Stars
November 12, 2008
How often do you get to have two of the giants of mathematics Graham and Knuth co-author (with Patashnik) a book like this - even suitable for high-school students?
Don't let the binding or whatever fools you, this is a serious math book and serious thinking is required. The material is broad and interesting. I think the book can be used as a supplement text to any of the discrete math/algorithm course (or just leisure reading). It will serve you years to come. Extra bonus - the marginal notes. It may be annoying to you or not but I found it funny at times.
I echo the same feeling as some of the readers here - keep this one always within reach. This is a future classic!
| |
enjoying the struggle by Yury Brodskiy (outside) 5 Stars
November 04, 2008
really good book, some times it's bit hard to comprehend, but I'm enjoying the struggle.
| |
Long Live Concrete Mathematics! by Scott W. Clawson (New Jersey, USA) 5 Stars
July 21, 2008
I had the pleasure of taking the course "Concrete Mathematics" with Ron Graham as an undergrad engineering student at Princeton University in the late 1980s, and in retrospect it was quite possibly the highlight of my academic career. Likewise, this text has a cherished spot in my bookcase even to this day. The material is challenging, sometimes downright frustrating, but good stuff nonetheless... and as others have noted, very useful! The skills gained are specifically tailored for application in fields such as computer science, really a number of disciplines; and complement what one learns in the more "standard" math courses. How many academic texts have become must-haves even beyond your college years? For me, only this one. I'd give it fifteen stars if I could.
| |
A difficult but worthwhile mathematics text by calvinnme (Fredericksburg, Va) 4 Stars
June 25, 2007
This book's title can be misleading. I would say it is more of an advanced textbook on the mathematics that is a foundation for computer science than a foundational book on the mathematics of computer science. I think this misreading of the title and thus the book's content is what is behind much of the heartache that readers have when trying to tackle it. This book expands on the "Mathematical Preliminaries" portion of "The Art of Computer Programming" series of books by Knuth, and thus this book has a style much like that series of books. The book is complete and clear, but it is also densely packed with lots of theory and proofs and will require much effort and time to understand well. It is really not meant to be an applied mathematics textbook at all. I show the table of contents next. Note that there are exercises at the conclusion of each chapter with solutions in the back of the book. However, most of the exercises are not so simple that you can just glimpse at the solution and figure out how to get from A to B. I recommend it if you have the time. It can really bring out thoughts and the beauty of mathematics that you may not have considered before.
1. Recurrent Problems.
The Tower of Hanoi.
Lines in the Plane.
The Josephus Problem.
Exercises.
2. Sums.
Notation.
Sums and Recurrences.
Manipulation of Sums.
Multiple Sums.
General Methods.
Finite and Infinite Calculus.
Infinite Sums.
Exercises.
3. Integer Functions.
Floors and Ceilings.
Floor/Ceiling Applications.
Floor/Ceiling Recurrences.
'mod': The Binary Operation.
Floor/Ceiling Sums.
Exercises.
4. Number Theory.
Divisibility.
Factorial Factors.
Relative Primality.
'mod': The Congruence Relation.
Independent Residues.
Additional Applications.
Phi and Mu.
Exercises.
5. Binomial Coefficients.
Basic Identities.
Basic Practice.
Tricks of the Trade.
Generating Functions.
Hypergeometric Functions.
Hypergeometric Transformations.
Partial Hypergeometric Sums.
Mechanical Summation.
Exercises.
6. Special Numbers.
Stirling Numbers.
Eulerian Numbers.
Harmonic Numbers.
Harmonic Summation.
Bernoulli Numbers.
Fibonacci Numbers.
Continuants.
Exercises.
7. Generating Functions.
Domino Theory and Change.
Basic Maneuvers.
Solving Recurrences.
Special Generating Functions.
Convolutions.
Exponential Generating Functions.
Dirichlet Generating Functions.
Exercises.
8. Discrete Probability.
Definitions.
Mean and Variance.
Probability Generating Functions.
Flipping Coins.
Hashing.
Exercises.
9. Asymptotics.
A Hierarchy.
O Notation.
O Manipulation.
Two Asymptotic Tricks.
Euler's Summation Formula.
Final Summations.
Exercises.
A. Answers to Exercises.
B. Bibliography.
| |
SIMILAR PRODUCTS |
| The Algorithm Design Manual
by Steven S. Skiena (Author)
This expanded and updated second edition of a classic bestseller continues to take the "mystery" out of designing and analyzing algorithms and their efficacy and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms. NEW: (1) Incorporates twice the tutorial material and exercises. (2) Provides full...
| 
| Art of Computer Programming, The, Volumes 1-3 Boxed Set (2nd Edition) (Vol 1-3)
by Donald E. Knuth (Author)
Knuth's multivolume work, widely recognized as the definitive description of classical computer science, is now available in an attractive, boxed set. The three volumes included in this set have each been revised recently to reflect developments in the field. As earlier editions clearly demonstrated, they comprise an invaluable resource in programming theory and practice for students, researchers, and practitioners alike. Countless readers have spoken about the profound personal influence of...
| 
| Introduction to Algorithms, Third Edition
by Thomas H. Cormen (Author), Charles E. Leiserson (Author), Ronald L. Rivest (Author), Clifford Stein (Author)
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little...
| 
| Hacker's Delight
by Henry S. Warren (Author)
Veteran programmer Hank Warren shares the tricks he has collected from his considerable experience in the worlds of application and system programming. For anyone who wants to create efficient code. Self-directed study.
| 
| Companion to Concrete Mathematics: Mathematical Techniques and Various Applications
by Z. A. Melzak (Author)
This two-volume treatment in a single binding supplements standard mathematics courses. Written to remedy the common mistake of emphasizing generality and abstract principles at the expense of concreteness, it stresses formal manipulations, intuitive appeal, and ingenuity. It employs physical analogies, encourages problem formulation, and supplies problem-solving methods. 1973 and 1976 editions.
|
|
|
