Mariconda & Tonolo. Discrete Calculus: Methods for Counting
An introduction to combinatorics, finite calculus, formal series, recurrences, and approximations of sums. Readers will find also deep insights into a range of less common topics rarely considered within a single book.
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
Eck & Critchlow. Foundations of Computation math.hws.edu
for a one-semester course in theoretical computer science. It has no prerequisites other than introductory computer programming. It includes logic, sets, and function from discrete math, and automata, formal languages, and grammar from upper-level courses.
-
Demaine, Abel & Chapman. Mathematics for Computer Science ocw.mit.edu
A junior introduction to discrete mathematics for computer scientists. - Companion Textbook 2015
-
Rosenberg & Trystram. Understand Mathematics, Understand Computing: Discrete Mathematics That All Computing Students… springer.com
It endows the reader with an operational conceptual and methodological understanding of discrete mathematics for computing
-
Rosen. Handbook of Discrete and Combinatorial Mathematics taylorfrancis.com
A complete survey of roughly all topics of discrete math and their relevance to computing and communication engineering.
-
Advanced Calculus people.math.harvard.edu
Lynn Loomis, Schlomo Sternberg.
-
Comprehensive Mathematics for Computer Scientists springer.com
A series dedicated to math topics and their relevance to computer science.
Theoretical Computer Science › Discrete Mathematics > Other: “An introduction to combinatorics, finite calculus, formal series, recurrences, and approximations of sums. Readers will find also deep insights into a range of less common topics rarely considered within a single book.”