Discrete Mathematics

The study of mathematical structures that are fundamentally discrete, in the sense of not supporting or requiring the notion of continuity.

All categoriesBooks under this sub-category (10 books)

A Short Course in Discrete Mathematics

The first part of the two series of book, used to teach discrete mathematics that includes Boolean arithmetic, combinatorics, elementary logic, induction, graph theory and finite probability in the University of California, San Diego.

A Short Course in Discrete Mathematics

The first part of the two series of book, used to teach discrete mathematics that includes Boolean arithmetic, combinatorics, elementary logic, induction, graph theory and finite probability in the University of California, San Diego.

Discrete Math for Computer Science Students

This text teaches all the math, with the exception of linear algebra, that is needed to succeed in computer science.

Discrete Math for Computer Science Students

This text teaches all the math, with the exception of linear algebra, that is needed to succeed in computer science.

This book discusses a number of selected results and methods on discrete mathematics, mostly from the areas of combinatorics, graph theory, and combinatorial geometry, with a little elementary number theory.

This book discusses a number of selected results and methods on discrete mathematics, mostly from the areas of combinatorics, graph theory, and combinatorial geometry, with a little elementary number theory.

Discrete Mathematics with Algorithms

A first-year course in discrete mathematics which requires no calculus or computer programming experience. Provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic problem-solving.

Discrete Mathematics with Algorithms

A first-year course in discrete mathematics which requires no calculus or computer programming experience. Provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic problem-solving.

Foundations of Combinatorics with Applications

Intended as an introduction to the mathematical foundations of the interaction between computer science and mathematics as a major impetus for theoretical developments and applications of combinatorics.

Foundations of Combinatorics with Applications

Intended as an introduction to the mathematical foundations of the interaction between computer science and mathematics as a major impetus for theoretical developments and applications of combinatorics.

Covers generating functions as a bridge between discrete mathematics, on the one hand, and continuous analysis (particularly complex variable theory) on the other.

Covers generating functions as a bridge between discrete mathematics, on the one hand, and continuous analysis (particularly complex variable theory) on the other.

Lecture Notes in Discrete Mathematics

Designed for a one semester course in discrete mathematics for sophomore or junior level students.

Lecture Notes in Discrete Mathematics

Designed for a one semester course in discrete mathematics for sophomore or junior level students.

Mathematics for Algorithm and Systems Analysis

The second part of the two series of book, used to teach discrete mathematics that includes Boolean arithmetic, combinatorics, elementary logic, induction, graph theory and finite probability in the University of California, San Diego.

Mathematics for Algorithm and Systems Analysis

The second part of the two series of book, used to teach discrete mathematics that includes Boolean arithmetic, combinatorics, elementary logic, induction, graph theory and finite probability in the University of California, San Diego.

Mathematics for Computer Science

This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods.

Mathematics for Computer Science

This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods.

Covers fundamental concepts and tools in discreet mathematics with emphasis on their applications to computer science.

Covers fundamental concepts and tools in discreet mathematics with emphasis on their applications to computer science.

Book Categories

Computer Science
37
Introduction to Computer Science
40
Algorithms and Data Structures
18
Object Oriented Programming
21
Theory of Computation
18
Formal Methods
17
Functional Programming
10
Logic Programming
22
Artificial Intelligence
21
Computer Vision
7
Big Data
3
Neural Networks
18
Compiler Design and Construction
16
Computer Organization and Architecture
8
Parallel Computing
3
Concurrent Programming
22
Operating Systems
20
Data Communication and Networks
24
Information Security
6
Information Theory
23
Digital Libraries
14
Information Systems
61
Software Engineering
17
Game Development and Multimedia
9
Data Mining
19
Machine Learning

Mathematics
63
Mathematics
9
Algebra
5
Calculus
5
Category Theory
23
Linear Algebra
15
Computer Aided Mathematics
2
Proofs
10
Discrete Mathematics
6
Numerical Methods
2
Number Theory
7
Graph Theory
13
Operations Research
20
Statistics
3
Probability

Supporting Fields
Operating System
Programming/Scripting
6
Ada
12
Assembly
31
C / C++
8
Common Lisp
2
Forth
33
Java
8
JavaScript
1
Lua
13
Microsoft .NET
11
Perl
5
PHP
52
Python
1
Rebol
9
Ruby
1
Scheme
3
Tcl/Tk

Miscellaneous
Most Popular Books

398,274
Introduction to Objective Caml
211,220
Notes for the Course of Algorithms
178,481
Lessons In Electric Circuits
161,484
A Beginners C++
150,695
A Balanced Introduction to Computer Science
129,945
Introduction to Object-Oriented Programming Using C++
121,611
A Short Introduction to Operating Systems
119,595
Data Structures and Algorithms with Object-Oriented Design Patterns in C++
118,154
Programming The Nintendo Game Boy Advance: The Unofficial Guide
111,014
C Programming Tutorial (K&R version 4)