**Mathematics for Computer Science**

by Eric Lehman, F Thomson Leighton, Albert R Meyer

**Publisher**: MIT 2010**Number of pages**: 557

**Description**:

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:

**Download link**

(3.2MB, PDF)

## Similar books

**Temporal Networks**

by

**Petter Holme, Jari SaramÃ¤ki**-

**arXiv**

In this review, the authors present the emergent field of temporal networks, and discuss methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamic systems.

(

**11119**views)

**Languages and Machines**

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.

(

**19619**views)

**Advances in Discrete Differential Geometry**

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.

(

**7128**views)

**Lists, Decisions, and Graphs**

by

**Edward A. Bender, S. Gill Williamson**-

**University of California, San Diego**

In this book, four basic areas of discrete mathematics are presented: Counting and Listing, Functions, Decision Trees and Recursion, and Basic Concepts in Graph Theory. At the end of each unit is a list of Multiple Choice Questions for Review.

(

**6404**views)