**Discrete Mathematics for Computer Science**

by Jean Gallier

**Publisher**: arXiv 2008**ISBN/ASIN**: 1441980466**Number of pages**: 255

**Description**:

These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. I emphasize partial functions more than usual (after all, programs may not terminate for all input) and I provide a fairly complete account of the basic concepts of graph theory.

Download or read it online for free here:

**Download link**

(1.7MB, PDF)

## Similar books

**generatingfunctionology**

by

**Herbert S. Wilf**-

**A K Peters, Ltd.**

The book about main ideas on generating functions and some of their uses in discrete mathematics. Generating functions are a bridge between discrete mathematics and continuous analysis. The book is suitable for undergraduates.

(

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

(

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

(

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

(

**1255**views)