Abstract Algebra Algebra Algebraic Geometry Algebraic Topology Applied Mathematics Arithmetic Geometry Basic Algebra Basic Mathematics Calculus Category Theory Classical Analysis Combinatorics Commutative Algebra Complex Algebra Complex Analysis Differential Algebra Differential Analysis Differential Calculus Differential Equations Differential Geometry Differential Topology Discrete Mathematics Elliptic Curves Fourier Analysis Functional Analysis Fractals Fractional Calculus Geometric Algebra Geometry Geometric Topology Groups Theory Graph Theory Harmonic Analysis Higher Algebra History of Mathematics Homological Algebra Integral Calculus K-theory Lie Algebra Linear Algebra Mathematical Analysis Mathematical Series Modern Geometry Multivairable Calculus Number Theory Numerical Analysis Probability Theory Real Analysis Rings and Fileds Riemannian Geometry Theorems in Calculus Topology Trigonometry Set Theory Constants & Numerical Sequences
Discrete Mathematics by Andrew D. Ker
This PDF covers the following topics related to Discrete Mathematics : Introduction, Sets, Functions, Counting, Relations, Sequences, Modular Arithmetic, Asymptotic Notation, Orders.
Author(s): Andrew D. Ker, Oxford University Computing Laboratory
125 Pages
Discrete Structures by Allen Gehret
This PDF covers the following topics related to Discrete Mathematics : Introduction, Propositional Logic, Sets, and Induction, Relations, Functions, Counting, Sequences, Graphs and trees, A glimpse of infinity.
Author(s): Allen Gehret, UCLA
119 Pages
Elements of Discrete Mathematics by Richard Hammack
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.
Author(s): Richard Hammack
479 Pages
Discrete Mathematics II Set Theory for Computer Science
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.
Author(s): Glynn Winskel
112 Pages
Discrete Structures Lecture Notes by Vladlen Koltun
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.
Author(s): Vladlen Koltun
89 Pages
Applied Discrete Mathematics William Shoaff
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.
Author(s): William D Shoaff
NA Pages
Discrete Mathematics Lecture Notes Incomplete Preliminary Version
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.
Author(s): Laszlo Babai
96 Pages
Lecture Notes on Discrete Mathematics (PDF 111P)
This note covers the following topics: Preliminaries, Counting and Permutations, Advanced Counting, Polya Theory, Generating Functions and Its Applications.
Author(s): A. K. Lal
111 Pages
Discrete Mathematics for Computer Science
The goal of this lecture note is to introduce students to ideas and techniques from discrete mathematics that are widely used in Computer Science. This note covers the following topics: Propositional logic, Induction, Strong induction, Structural induction, Proofs about algorithms, Algebraic algorithms, Number theory, RSA, Basics of counting, basic probability,Conditional probability, Linearity of expectation, variance.
Author(s): Mike Clancy, David Wagner
NA Pages
Discrete Mathematics (PDF 139P)
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.
Author(s): L. Lovasz and K. Vesztergombi
139 Pages
Notes on Discrete Mathematics Miguel A. Lerma
This note covers the following topics: Logic, Proofs, Sets, Functions, Relations, Algorithms, Integers, Induction, Recurences, Counting, Probability, Graph Theory, Trees, Boolean Algebra, Automata, Grammars and Languages.
Author(s): Miguel A. Lerma
154 Pages
Introduction to Finite Mathematics
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
NA Pages
Discrete Mathematics Study Guide UVIC
This note covers the following topics: Logic and Foundations, Proposition logic and quantifiers, Set Theory, Mathematical Induction, Recursive Definitions, Properties of Integers, Cardinality of Sets, Pigeonhole Principle, Combinatorial Arguments, Recurrence Relations.
Author(s): Dr. Gary MacGillivray
NA Pages
Fundamental Problems in Algorithmic Algebra
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.
Author(s): Chee Yap
NA Pages
Introduction to Complexity Classes
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.
Author(s): Chee K. Yap
NA Pages
Currently this section contains no detailed description for the page, will update this page soon.
Author(s): NA
NA PagesAdvertisement
