Mathematics for computer science
By: Lehman, Eric
| Leighton, F. Thomson | Meyer, Albert R
Language: English Publisher: Creative Common License 2017Edition: Rev. edDescription: viii, 998p.; 28cmISBN: 9781680921229Subject(s): Computer science | Mathematical principlesDDC classification: 004.0151 LEH/M Online resources: Publisher's URL Summary: 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.
No physical items for this record
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.