DeepRead
Cover of Concrete mathematics

About the book

The book covers the discrete mathematics used in computer science and the analysis of algorithms. Its topics include sums, recurrences, integer functions, binomial coefficients, generating functions, number theory, asymptotic estimation, and discrete probability. It mixes continuous and discrete methods throughout. The authors contend that programmers and analysts need a working toolkit for manipulating concrete formulas, not only abstract theory. They hold that many exact closed forms for sums and recurrences can be derived through systematic technique, and that asymptotic notation is most useful when applied with care. The text presents these skills through specific problems, so that rigor and practical problem-solving are learned together.

Written by Claude from what it knows of this book.

What Hacker News says 65% recommend · 1% critical

02040200720102015202020262018 peak · 31
This bookAverage book in Mathematics surveys and history

In the commenters’ own words

What Open Library readers say 4.80 from 5 ratings

  1. 54
  2. 41
  3. 30
  4. 20
  5. 10
  • 63 want to read
  • 2 reading
  • 6 have read

Only 5 ratings: treat the average as a hint.

Open Library’s page for the book

What Wikipedia says

  • published 1994
  • 657 pages
  • articles in 10 languages

Read the Wikipedia article

Reddit communities — coming later

The threads it came up in

Details

First published
1988
ISBN
9780201558029
Editions known
16 at Open Library
Open Library
OL3951639W

51054.10AlgorithmeAlgorithmesAnalysisCalcul formelCiencias computacionalesCiencias computacionales--matemáticasComputer scienceComputer science, mathematicsComputer science--mathematicsDat 542fInformatiqueInformatique--mathématiques

Explore in the mosaic

Read next: its neighbours on the mosaic