This page covers the
following topics related to Discrete Mathematics : 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.
This page covers the
following topics related to Discrete Mathematics : 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.
This book covers the following topics: Discrete
Systems,Sets, Logic, Counting, Discrete Probability, Algorithms, Quantified
Statements, Direct Proof, Proofs Involving Sets, Proving Non-Conditional
Statements, Cardinality of Sets, Complexity of Algorithms.
This note
explains the following topics: Induction and Recursion, Steiner’s Problem,
Boolean Algebra, Set Theory, Arithmetic, Principles of Counting, Graph Theory.
This
lecture note describes the following topics: Sets and Notation, Induction, Proof
Techniques, Divisibility, Prime Numbers, Modular Arithmetic, Relations and
Functions, Mathematical Logic, Counting, Binomial Coefficients, The
Inclusion-Exclusion Principle, The Pigeonhole Principle, Asymptotic Notation,
Graphs, Trees, Planar Graphs.
This
note covers the following topics: Logic, Asymptotic Notation, Convex Functions
and Jensen’s Inequality, Basic Number Theory, Counting, Binomial coefficients,
Graphs and Digraphs, Finite Probability Space, Finite Markov Chains.
This
note covers the following topics: Sets, Functions and Relations, Proofs
and Induction, Number Theory, Counting, Probability, Logic, Graphs, Finite
Automata.
This is a course
note on discrete mathematics as used in Computer Science. Topics covered
includes: Mathematical logic, Set theory, The real numbers, Induction and
recursion, Summation notation, Asymptotic notation, Number theory, Relations,
Graphs, Counting, Linear algebra, Finite fields.
This note
explains the following topics: Arithmetic, Logic and Numbers, Boolean Functions
and Computer Arithmetic, Number Theory and Cryptography, Sets, Equivalence and
Order, Functions, Induction, Sequences and Series, Lists, Decisions and Graphs,
Basic Counting and Listing, Decision Trees, Basic Concepts in Graph Theory.
Author(s): Edward A. Bender and S. Gill Williamson
This note
covers the following topics: induction, counting subsets, Pascal's triangle,
Fibonacci numbers, combinatorial probability, integers divisors and primes,
Graphs, Trees, Finding the optimum, Matchings in graphs, Graph coloring.
This note covers the following topics:
Compound Statements, Sets and subsets, Partitions and counting,
Probability theory, Vectors and matrices, Linear programming and the
theory of games, Applications to behavioral science problems.
Author(s): John G. Kemeny, J. Laurie
Snell, and Gerald L. Thompson
This
book explains the following topics: Computability, Initiation to Complexity Theory, The Turing Model: Basic
Results, Introduction to the Class NP, Reducibilities, Complete
Languages, Separation Results, Stochastic Choices, Quantum Complexity,
Theory of Real Computation and Kolmogorov Complexity.