Mathematics for Computer Science -- Eric Lehman

<p>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.</p><p>The color images and text in this book have been converted to grayscale.</p><br><br><b>Author:</b> Eric Lehman, F. Thomson Leighton, Albert R. Meyer<br><b>Publisher:</b> 12th Media Services<br><b>Published:</b> 06/05/2017<br><b>Pages:</b> 1010<br><b>Binding Type:</b> Paperback<br><b>Weight:</b> 5.04lbs<br><b>Size:</b> 11.00h x 8.50w x 1.99d<br><b>ISBN:</b> 9781680921229<p></p>