Mathematics for Computer Science - Hardcover
Mathematics for Computer Science - Hardcover
Description
by Eric Lehman (Author), F. Thomson Leighton (Author), Albert R. Meyer (Author)
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.
Care
To maintain the beauty and integrity of your purchase, we recommend treating it with care. Simple maintenance practices, such as gentle washing and proper storage, can effectively preserve the longevity of your favorites. We encourage you to refer to the care instructions included with each item, designed to help you keep your purchase in top condition.
Design
Our dedication to excellence extends beyond materials; it encompasses the artistry and craftsmanship illustrated in every piece we create.