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 Mathematics by William Chen
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.
Author(s): William Chen
NA Pages
Lecture Notes On Discrete Mathematical Structures iare
The contents include: Mathematical Logic, Relations, Algebraic structures, Recurrence Relation, Graph Theory.
Author(s): Mrs. B Pravallika, Assistant Professor,Information Technology, Institute of Aeronautical Engineering
95 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 Mathematics Course Notes by Drew Armstrong
This note explains the following topics: Induction and Recursion, Steiner’s Problem, Boolean Algebra, Set Theory, Arithmetic, Principles of Counting, Graph Theory.
Author(s): Drew Armstrong
151 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
A Collection of Short Lectures on Discrete Mathematics
This note covers the following topics: Boolean Logic, Sets, Predicate Logic, Sequences, Recursion, Mathematical Induction, Relations, Functions, Naming Systems, Number Systems, Proofs.
Author(s): William D Shoaff
NA Pages
A Course in Discrete Structures
This note covers the following topics: Sets, Functions and Relations, Proofs and Induction, Number Theory, Counting, Probability, Logic, Graphs, Finite Automata.
Author(s): Rafael Pass and Wei-Lung Dustin Tseng
153 Pages
Notes on Discrete Mathematics by James Aspnes
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.
Author(s): James Aspnes
390 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
This note covers the following topics: Factorials , Binomial Theorem, Sequence and Series, Mathematical Induction.
Author(s): University of Southern Queensland
42 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 PagesAdvertisement
