**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

**Discrete Mathematics with Algorithms**

by

**M. O. Albertson, J. P. Hutchinson**-

**J. Wiley**

This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs...

(

**8024**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.

(

**5969**views)

**Topics in Discrete Mathematics**

by

**A.F. Pixley**-

**Harvey Mudd College**

This text is an introduction to a selection of topics in discrete mathematics: Combinatorics; The Integers; The Discrete Calculus; Order and Algebra; Finite State Machines. The prerequisites include linear algebra and computer programming.

(

**9237**views)

**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.

(

**10011**views)