Mathematics for Computer Science
by Eric Lehman, F Thomson Leighton, Albert R Meyer
Publisher: MIT 2010
Number of pages: 557
This text offers an introduction to Discrete Mathematics oriented toward Computer Science and Engineering. Topics covered: Fundamental concepts of Mathematics: definitions, proofs, sets, functions, elementary number theory; Discrete structures: graphs, counting; Discrete probability theory.
Download or read it online for free here:
by C. D. H. Cooper - Macquarie University
This is a text on discrete mathematics. It includes chapters on logic, set theory and strings and languages. There are some chapters on finite-state machines, some chapters on Turing machines and computability, and a couple of chapters on codes.
by J. G. Kemeny, J. L. Snell, G. L. Thompson - Prentice-Hall
This book introduces college students to the elementary theory of logic, sets, probability theory, and linear algebra and treats a number of applications either from everyday situations or from applications to the biological and social sciences.
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. This book will help you think well about discrete problems: problems where tools like calculus fail because there's no continuity.
by Alexander I. Bobenko (ed.) - Springer
This is the book on a newly emerging field of discrete differential geometry. It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics.