Albert R. Meyer

Eric Lehman

F. Thomson Leighton

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.

Mathematics for Computer Science

Takayasu Ito

TACS.

This volume gives the proceedings of TACS '91, which focused on theoretical foundations of programming, and theoretical aspects of the design, analysis and implementation of programming languages and systems.

Albert R. Meyer

About

Books

Join the club