Jump to content

User:Jbeer42/Books/Discrete Mathematics

From Wikipedia, the free encyclopedia

The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services.

You can still create and edit a book design using the Book Creator and upload it to an external rendering service:

MediaWiki2LaTeX provides a softcopy PDF service. Uniquely, it remains under active support and may be used online or installed locally.
Pedia Press offer final tidying and ordering of print-on-demand bound copies in (approximately) A5 format.

For help with downloading a single Wikipedia page as a PDF, see Help:Download as PDF.

This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance).

Edit this book: Book Creator · Wikitext

Order a printed copy from: PediaPress

[ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ]

Discrete Mathematics

A* search algorithm

A. W. F. Edwards

Abstract algebra

Abstract simplicial complex

Abu Bakr bin Yahya al-Suli

Ackermann function

Acyclic orientation

Additively indecomposable ordinal

Adjacency matrix

Admissible heuristic

Aho–Corasick algorithm

Albert-László Barabási

Alexander Brudno

Algebraic graph theory

Algebraic notation (chess)

Alpha–beta pruning

Alternating sign matrix

American Mathematical Society

American School for the Deaf

Amortized analysis

Analysis of algorithms

Any-angle path planning

Approximation algorithm

Approximation error

Array data structure

Art gallery problem

Arthur Moritz Schoenflies

Artificial intelligence

Artificial neural network

Artificial neuron

Asymptotic computational complexity

Attribute grammar

Automated theorem proving

Autonomous system (Internet)

Average path length

Axiom of choice

Axiom of dependent choice

Axiom of determinacy

Axiom of power set

Axiom of regularity

Axiom schema of replacement

Axiom schema of specification

Balinski's theorem

Barnes & Noble Nook

Base unit (measurement)

Bayesian network

BBVA Foundation Frontiers of Knowledge Award

Bellman equation

Bellman–Ford algorithm

Bernard Bolzano

Bernard Chazelle

Bertram Raphael

Bertrand Russell

Best, worst and average case

Best-first search

Bianconi–Barabási model

Bidirectional search

Binary relation

Bipartite graph

Bipolar orientation

Birkhoff polytope

Bitwise operation

Board representation (chess)

Boolean algebra (structure)

Boolean-valued model

Borel equivalence relation

Borel hierarchy

Branch and bound

Branching factor

Branko Grünbaum

Breadth-first search

Bridge (graph theory)

Broken diagonal

Brute-force search

Burali-Forti paradox

Burnside's lemma

Béla Bollobás

California Institute of Technology

Canastota, New York

Cantor's paradise

Cardinal function

Cardinal number

Carl Friedrich Gauss

Carol Vorderman

Carsten Thomassen

Cartesian product

Cartesian product of graphs

Case Western Reserve University

Category (mathematics)

Category theory

Cheney's algorithm

Christian Weise

Church–Kleene ordinal

Circular definition

Citation analysis

Clarence Irving Lewis

Class (set theory)

Classical logic

Clique (graph theory)

Clustering coefficient

Cofinal (mathematics)

Combination puzzle

Combinatorial explosion

Combinatorial optimization

Comparability graph

Complement (set theory)

Complement graph

Complete bipartite graph

Complete coloring

Computability theory

Computable function

Computational biology

Computational chemistry

Computational complexity theory

Computational geometry

Computational linguistics

Computer History Museum

Computer Modern

Computer performance

Computer science

Computer scientist

Conceptual graph

Concrete Mathematics

Conjugate gradient method

Connected component (graph theory)

Connected-component labeling

Connectivity (graph theory)

Connersville, Indiana

Consistent heuristic

Constraint programming

Constraint satisfaction problem

Constructible universe

Constructive proof

Constructive set theory

Constructivism (mathematics)

Continuum hypothesis

Controversy over Cantor's theory

Convex combination

Convex polytope

Conway chained arrow notation

Covering problems

Critical path method

Crossing number (graph theory)

Cube-connected cycles

Cumulative hierarchy

Cuthill–McKee algorithm

Cycle (graph theory)

Cycle detection

Cycle double cover

Cyclic permutation

Dartmouth Conferences

Database transaction

De Bruijn graph

Decision problem

Degeneracy (graph theory)

Degree (graph theory)

Degree distribution

Depth-first search

Descriptive notation

Descriptive set theory

Deterministic finite automaton

Diagonally dominant matrix

Dijkstra's algorithm

Directed acyclic graph

Discrete mathematics

Discrete optimization

Disjoint-set data structure

Distance matrix

Distance-hereditary graph

Distance-regular graph

Distance-transitive graph

Distance-vector routing protocol

Domain of discourse

Donald B. Johnson

Doron Zeilberger

Double recursion

Doubly linked list

Doubly stochastic matrix

Dual-phase evolution

Duality (optimization)

Dynamic Bayesian network

Dynamic programming

Edge (geometry)

Edge contraction

Edsger W. Dijkstra

Edward F. Moore

Effective descriptive set theory

Eight queens puzzle

Electrical engineering

Electrical grid

Element (mathematics)

Elementary matrix

Endre Szemerédi

Entitative graph

Entropy (information theory)

Epsilon numbers (mathematics)

Equivalence class

Equivalence relation

Erdős–Faber–Lovász conjecture

Erdős–Rado theorem

Erdős–Rényi model

Euclidean distance

Euclidean space

Evolving networks

Existential graph

Existential quantification

Exponential function

Exponential growth

Extremal graph theory

Fairy chess piece

Faithful representation

Fast marching method

Fast-growing hierarchy

Feature structure

Finite state transducer

Finite-state machine

First-order logic

Fisher–Yates shuffle

Floor and ceiling functions

Floyd–Steinberg dithering

Folded cube graph

Forbidden graph characterization

Forcing (mathematics)

Ford–Fulkerson algorithm

Forward error correction

Foundations of mathematics

Four color theorem

Frankl–Rödl graph

French Academy of Sciences

Function (mathematics)

Gabriel Andrew Dirac

Gallai–Hasse–Roy–Vitaver theorem

Gallery of named graphs

Game Boy Advance

Garbage collection (computer science)

Gaussian elimination

Gauss–Seidel method

General set theory

General topology

Generalized permutation matrix

Genetic algorithm

Genus (mathematics)

Geographic information system

Geometric graph theory

Geometric networks

Georg Cantor's first set theory article

George Koltanowski

Glossary of chess

Glossary of graph theory

Glossary of set theory

Glossary of Sudoku

Goal node (computer science)

God's algorithm

Goodstein's theorem

Gottfried Wilhelm Leibniz

Grace Chisholm Young

Grace Murray Hopper Award

Graham Brightwell

Graham's number

Graph (abstract data type)

Graph (discrete mathematics)

Graph automorphism

Graph bandwidth

Graph enumeration

Graph factorization

Graph homomorphism

Graph isomorphism

Graph operations

Graph rewriting

Graph sandwich problem

Graph traversal

Graphic Adventure Creator

Graphical model

Greedy algorithm

Gustave Choquet

Hadwiger conjecture (graph theory)

Halved cube graph

Hamiltonian path

Hamiltonian path problem

Hamming distance

Hassler Whitney

Head-driven phrase structure grammar

Hebdomada Aenigmatum

Henri Poincaré

Henry John Stephen Smith

Herbert A. Simon

Heuristic (computer science)

Hidden Markov model

Homotopy type theory

Hyperarithmetical theory

Identity element

Identity matrix

IEEE John von Neumann Medal

Impredicativity

Inaccessible cardinal

Incidence matrix

Incremental heuristic search

Independence (probability theory)

Independent set (graph theory)

Indian mathematics

Induced subgraph

Infimum and supremum

Infinitary combinatorics

Injective function

Inner model theory

Institute for Defense Analyses

Instruction set

Integer programming

Internal energy

Internal set theory

Intersection (road)

Intersection (set theory)

Intersection graph

Intuitionistic logic

Invariant (mathematics)

Inverse function

Inversion (discrete mathematics)

Invertible matrix

Island algorithm

Iterative deepening A*

Iterative deepening depth-first search

James Joseph Sylvester

James Whitbread Lee Glaisher

Jan Łukasiewicz

Jaroslav Nešetřil

Java (programming language)

Job shop scheduling

John Adrian Bondy

John McCarthy (computer scientist)

John von Neumann

Johnson's algorithm

Joint probability distribution

Jump point search

K-edge-connected graph

K-vertex-connected graph

Karl Weierstrass

Killer heuristic

Kirchhoff's theorem

Kleene's algorithm

Klein's encyclopedia

Knuth's Algorithm X

Knuth's Simpath algorithm

Knuth's up-arrow notation

Knuth–Bendix completion algorithm

Knuth–Morris–Pratt algorithm

Kripke–Platek set theory

Kruskal's algorithm

L. R. Ford, Jr.

La France (French newspaper)

Laplacian matrix

Large countable ordinal

Law of excluded middle

Layered graph drawing

Leopold Kronecker

Level structure

Lexical semantics

Lexicographic breadth-first search

Lexicographic product of graphs

Lexicographical order

Linear programming

Link (geometry)

Link-state routing protocol

List edge-coloring

List of Fellows of the Royal Society elected in 2003

List of graph theory topics

List of important publications in mathematics

List of order structures in mathematics

List of scholars on the relationship between religion and science

List of set theory topics

Literate programming

Logic programming

Logical conjunction

Logical connective

Logical disjunction

Logical equivalence

London Underground

Longest path problem

Longest uncrossed knight's path

Loop (graph theory)

Low-density parity-check code

Ludwig Wittgenstein

László Lovász

Lévy family of graphs

Mainframe computer

Man or boy test

Marginal distribution

Maria Chudnovsky

Marko Petkovšek

Markov random field

Marshall Hall (mathematician)

Martin Charles Golumbic

Massachusetts Institute of Technology

Matching (graph theory)

Mathematical analysis

Mathematical chess problem

Mathematical game

Mathematical induction

Mathematical logic

Mathematical object

Mathematical puzzle

Mathematics of Sudoku

Matrix (mathematics)

Matrix multiplication

Maven (Scrabble)

Max-flow min-cut theorem

Maxima and minima

Maximum a posteriori estimation

Maximum flow problem

Measurable cardinal

Mechanical puzzle

Min-conflicts algorithm

Minesweeper (video game)

Minimum spanning tree

Monotone priority queue

Monte Carlo method

Morse–Kelley set theory

Multiple discovery

Multiplication table

Möbius configuration

Naive set theory

National Academy of Sciences

National Medal of Science

Natural language processing

Nearest neighbour algorithm

Negative number

Neighbourhood (graph theory)

Neil Robertson (mathematician)

Network science

Network topology

New Foundations

Nils John Nilsson

No-three-in-line problem

Non-well-founded set theory

Nondeterministic algorithm

Normal distribution

Norwegian Academy of Science and Letters

NP-completeness

Numbers (TV series)

Open Shortest Path First

Optimality theory

Order isomorphism

Ordinal arithmetic

Orientation (graph theory)

Otakar Borůvka

Output-sensitive algorithm

P versus NP problem

Pancyclic graph

Parallel computing

Parameterized complexity

Parity (mathematics)

Parity of a permutation

Partial permutation

Partially ordered set

Partition function (mathematics)

Partition of a set

Pascal (programming language)

Path (graph theory)

Pathfinder network

Paul Seymour (mathematician)

Pebble motion problems

Percy John Heawood

Permutation group

Permutation matrix

Persistence (computer science)

Pixel connectivity

PlayStation Portable

Ply (game theory)

Pointless topology

Positive feedback

Positive-definite matrix

Power graph analysis

Preferential attachment

Prim's algorithm

Primitive recursive function

Princeton University

Principal variation search

Principia Mathematica

Principle of compositionality

Probability distribution

Probability mass function

Programming language

Projective hierarchy

Propositional calculus

Pruning (decision trees)

Quantifier (logic)

Queue (abstract data type)

Quiver (mathematics)

Ramsey's theorem

Randolph diagram

Random permutation

Random regular graph

Random variable

Raphael M. Robinson

Raster graphics editor

Ravindran Kannan

Reconstruction conjecture

Recreational mathematics

Recursion (computer science)

Regular expression

Relational model

Relaxation (iterative method)

René Descartes

Representation (mathematics)

Reuben Goodstein

Richard Dedekind

Richard E. Bellman

Ring (mathematics)

Robbins' theorem

Robert W. Floyd

Robin Thomas (mathematician)

Robinson–Schensted–Knuth correspondence

Rook polynomial

Rotational symmetry

Route inspection problem

Routing (electronic design automation)

Routing Information Protocol

Routing protocol

Rumor spread in social network

Russell's paradox

Scale-free network

Search algorithm

Second-order logic

Self-balancing binary search tree

Semantic network

Series-parallel graph

Set (mathematics)

Set cover problem

Set-builder notation

Set-theoretic topology

Seven Bridges of Königsberg

Shakey the robot

Sharp-P-complete

Shortest path problem

Shortest-path tree

Simplex algorithm

Simplicial complex

Simulated annealing

Six Degrees of Kevin Bacon

Small-world network

Snake-in-the-box

Social network analysis

Society for Industrial and Applied Mathematics

Solomon Feferman

Spectral graph theory

Spectral radius

SRI International

Stack (abstract data type)

Standard 52-card deck

Stanford University

Stanford University centers and institutes

Stanford University School of Engineering

State space search

Statistical mechanics

Steiner tree problem

Stephen Warshall

Stigler's law of eponymy

Stochastic context-free grammar

Stone's representation theorem for Boolean algebras

Strong orientation

Strong perfect graph theorem

Strong product of graphs

Strongly connected component

Strongly regular graph

Structure (mathematical logic)

Structured programming

Subgraph isomorphism problem

Successive over-relaxation

Successor function

Successor ordinal

Sudoku solving algorithms

Sumner's conjecture

Surjective function

Suurballe's algorithm

Symmetric graph

Symmetric group

Symmetric relation

Symmetry in mathematics

Syracuse, New York

Systematic sampling

Szemerédi regularity lemma

Szymanski's conjecture

Tarski–Grothendieck set theory

Taxicab geometry

Technion – Israel Institute of Technology

Tensor product of graphs

The Art of Computer Programming

The Baltimore Sun

The Complexity of Songs

The Conway Daily Sun

The Daily Telegraph

The Principles of Mathematics

The rich get richer and the poor get poorer

The Sydney Morning Herald

Theoretical computer science

Thermodynamic free energy

Things a Computer Scientist Rarely Talks About

Three cups problem

Three utilities problem

Time complexity

Topological graph theory

Topological sorting

Topological space

Tournament (graph theory)

Trabb Pardo–Knuth algorithm

Trace (linear algebra)

Transfinite induction

Transitive closure

Transitive reduction

Transposition table

Travelling salesman problem

Tree (data structure)

Tree (graph theory)

Tree decomposition

Trichotomy (mathematics)

Uncountable set

Union (set theory)

Unit distance graph

Univalent foundations

Universal property

Usenet newsgroup

Variation (game tree)

Variational Bayesian methods

Vertex (geometry)

Vertex (graph theory)

Vertex-transitive graph

Veselin Topalov

Visibility graph

Viswanathan Anand

Viterbi algorithm

Vojtěch Jarník

Von Neumann cardinal assignment

Von Neumann universe

Von Neumann–Bernays–Gödel set theory

Wadge hierarchy

Watch Hill, Rhode Island

Watts and Strogatz model

Weighted correlation network analysis

Well-ordering principle

Well-ordering theorem

Wheat and chessboard problem

White and Black in chess

Widest path problem

Wilhelm Ackermann

William Henry Young

Worcester, Massachusetts

World Chess Championship 2010

World Puzzle Championship

World Sudoku Championship

Zermelo set theory

Zermelo–Fraenkel set theory

Zero-suppressed decision diagram

Retrieved from "https://en.wikipedia.org/enwiki/w/index.php?title=User:Jbeer42/Books/Discrete_Mathematics&oldid=1250349752"

User namespace book pages