Eric Lehman,F. Thomson Leighton,Albert R. Meyer
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.
Science,Mathematics,Science,Computer Science,Computer Science,Technical,Computer Science,Programming,Science,Engineering,Reference,Textbooks,Computer Science,Computers,Computer Science,Algorithms,Science,Technology
Mathematics for Computer Science