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

(

**8802**views)

**Notes on Discrete Mathematics**

by

**Miguel A. Lerma**

Summary of the course CS 310: Mathematical Foundations of Computer Science. It covers concepts of discreet mathematics and applications to computer science, logic and Boolean circuits, functions, sets, relations, databases, finite automata, and more.

(

**16686**views)

**Lecture Notes in Discrete Mathematics**

by

**Marcel B. Finan**-

**Arkansas Tech University**

This book is designed for a one semester course in discrete mathematics for sophomore or junior level students. The text covers the mathematical concepts that students will encounter in computer science, engineering, Business, and the sciences.

(

**13217**views)

**Exploring Discrete Mathematics Using Maple**

by

**Kenneth H. Rosen**-

**Mcgraw-Hill College**

This is a guide to help you explore concepts in discrete mathematics using the computer system Maple. It is designed to be accessible to those who are complete novices with Maple and with computer programming, but it has much to offer even experts.

(

**5357**views)