Concrete Mathematics by Ronald Graham
A Foundation for Computer Science
A rigorous yet playful textbook that develops the mathematical tools and problem-solving techniques used in combinatorics and theoretical computer science, focusing on discrete and continuous techniques side-by-side. It explores topics such as integer sums and products, recurrences, generating functions, discrete probability, asymptotics, special summation methods (including discrete analogs of integration), binomial coefficients, and number-theoretic identities, emphasizing worked examples and challenging problems to build intuition for algorithm analysis and combinatorial reasoning.
Purchase from
Bookshop.org
- Published
- 1989
- Nationality
- American
- Length
- Long
- Pages
- 600-700
- Original Language
- English
- Avg User Rating
-
(4.0)
- Alternate Titles
- None
This book is not currently on any lists.