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
Lists, Decisions, and Graphsby 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.
(7560 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.
(19775 views)
Mathematics for Computer Scienceby Eric Lehman, F Thomson Leighton, Albert R Meyer - MIT
An introduction to discrete mathematics oriented toward Computer Science and Engineering. Topics covered: Fundamental concepts of Mathematics: sets, functions, number theory; Discrete structures: graphs, counting; Discrete probability theory.
(16794 views)
Discrete Differential Geometry: An Applied Introductionby M. Desbrun, P. Schroeder, M. Wardetzky - Columbia University
This new and elegant area of mathematics has exciting applications, as this text demonstrates by presenting practical examples in geometry processing (surface fairing, parameterization, and remeshing) and simulation (of cloth, shells, rods, fluids).
(14648 views)