Mathematics for Computer Science - Softcover

Lehman, Eric; Leighton, F Thomson; Meyer, Albert R

  • 3.85 out of 5 stars
    95 ratings by Goodreads
 
9781680921229: Mathematics for Computer Science

Synopsis

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.

The color images and text in this book have been converted to grayscale.

"synopsis" may belong to another edition of this title.

Other Popular Editions of the Same Title