
Mathematics for Computer Science
Sign in to keep track of books you’ve read and want to read.
This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.
Liked Mathematics for Computer Science? Here’s where I’d start.
These suit anyone who liked Mathematics for Computer Science. Sign in and mark a few books for picks shaped around your own taste.
-
Combinatorial Optimization: Algorithms and Complexity Shares math, computer science, cs -
From Mathematics to Generic Programming Shares math, computer science, programming -
Probability and Computing: Randomized Algorithms and Probabilistic Analysis Shares computer science, math, cs -
Elements of Programming Shares programming, computer science, math