• Title Mathematics for Computer Science
• Author(s) Eric Lehman, F. Thomson Leighton, Albert R. Meyer
• Publisher: 12th Media Services (June 5, 2017); eBook (June 6, 2018, Updated Yearly)
• License(s): CC BY-SA 3.0
• Paperback: 1010 pages
• eBook: PDF
• Language: English
• ISBN-10/ASIN: 1680921223
• ISBN-13: 978-1680921229
• Share This:  

Book Description

This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. It explores the topics of basic combinatorics, number and graph theory, logic and proof techniques, and many more.

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.

• N/A

• Amazon

• Discrete and Finite Mathematics
• Graph Theory
• Combinatorics and Game Theory
• Algebra, Abstract Algebra, and Linear Algebra
• Mathematical Logic (Set Theory, etc.)
• Probability and Stochastic Processes

• Mathematics for Computer Science (Eric Lehman, et al)
• Course Homepage (Video Lectures, Textbooks, Lecture Notes, etc.)

• Mathematics for Computer Scientists (Gareth J. Janacek, et al)
• Discrete Mathematics: An Open Introduction (Oscar Levin)
• Discrete Mathematics for Computer Science (Jean Gallier)
• Discrete Structures for Computer Science: Counting, Recursion, and Probability