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
Topics in Discrete Mathematicsby 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.
(4512 views)
Applied Finite Mathematicsby Rupinder Sekhon - Connexions
Applied Finite Mathematics covers topics including linear equations, matrices, linear programming (geometrical approach and simplex method), the mathematics of finance, sets and counting, probability, Markov chains, and game theory.
(7169 views)
Notes on Discrete Mathematicsby 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.
(14199 views)
Temporal Networksby 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.
(6540 views)