by W W L Chen
Publisher: Macquarie University 2008
Number of pages: 125
Logic and sets, relations and functions, the natural numbers, division and factorization, languages, finite state machines, finite state automata, Turing machines, groups and modulo arithmetic, introduction to coding theory, group codes, public key cryptography, principle of inclusion-exclusion, generating functions, number of solutions of a linear equation, recurrence relations, graphs, weighted graphs, search algorithms, digraphs.
Home page url
Download or read it online for free here:
(multiple PDF files)
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.
by 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.
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.
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.