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
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.
(12238 views)
Discrete Structuresby Vladlen Koltun - Stanford University
Contents: Sets and Notation; Induction; More Proof Techniques; Divisibility; Prime Numbers; Modular Arithmetic; Relations and Functions; Mathematical Logic; Counting; Binomial Coefficients; Inclusion-Exclusion Principle; Pigeonhole Principle; etc.
(12203 views)
Discrete Mathematics with Algorithmsby 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...
(10277 views)
Advances in Discrete Differential Geometryby 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.
(8415 views)