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.
The aim of this note is to introduce fundamental concepts and
techniques in set theory in preparation for its many applications in computer science. Topics covered includes: Mathematical
argument, Sets and Logic, Relations and functions, Constructions on
sets, Well-founded induction.
This note
explains the following topics: Induction and Recursion, Steiner’s Problem,
Boolean Algebra, Set Theory, Arithmetic, Principles of Counting, Graph Theory.
This note explains the
following topics: positional and modular number systems, relations and their
graphs, discrete functions, set theory, propositional and predicate logic,
sequences, summations, mathematical induction and proofs by contradiction.
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 covers the following topics: fundamentals of
mathematical logic , fundamentals of mathematical proofs , fundamentals of
set theory , relations and functions , introduction to the Analysis of
Algorithms, Fundamentals of Counting and Probability Theory and Elements of
Graph Theory.
Author(s): Marcel B. Finan, Arkansas Tech
University
This note
covers the following topics: Preliminaries, Counting and Permutations,
Advanced Counting, Polya Theory, Generating Functions and Its Applications.
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 book consists of six units of study: Boolean Functions and
Computer Arithmetic, Logic, Number Theory and Cryptography, Sets and Functions,
Equivalence and Order, Induction, Sequences and Series. Each of this is divided into two sections.
Each section contains a representative selection of problems. These vary from
basic to more difficult, including proofs for study by mathematics students or
honors students.
Author(s): Edward A. Bender and S. Gill
Williamson
This
book explains the following topics: Arithmetic, The Greatest Common Divisor, Subresultants, Modular
Techniques, Fundamental Theorem of Algebra, Roots of Polynomials, Sturm
Theory, Gaussian Lattice Reduction, Lattice Reduction and Applications,
Linear Systems, Elimination Theory, Groebner Bases, Bounds in Polynomial Ideal Theory and Continued
Fractions.
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.