Mathematics for Computer Science by Leighton Lehman
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.
| SKU | Unavailable |
| ISBN 13 | |
| ISBN 10 | |
| Title | Mathematics for Computer Science |
| Author | Leighton Lehman |
| Series | |
| Condition | Unavailable |
| Binding Type | |
| Publisher | |
| Year published | |
| Number of pages | |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |
View All Editions
Filter
Applied Filters (0)
Sort by:
Loading editions...