User:Jbeer42/Books/Discrete Mathematics

Discrete Mathematics

 * -yllion
 * 15 puzzle
 * 36 Cube
 * A* search algorithm
 * A. W. F. Edwards
 * Abstract algebra
 * Abstract simplicial complex
 * Abu Bakr bin Yahya al-Suli
 * Ackermann function
 * Acyclic orientation
 * Addition
 * Additively indecomposable ordinal
 * Adjacency list
 * Adjacency matrix
 * Admissible heuristic
 * Aho–Corasick algorithm
 * Alan Kotok
 * Alan M. Frieze
 * Albert-László Barabási
 * Alexander Brudno
 * Alfréd Rényi
 * Algebraic graph theory
 * Algebraic notation (chess)
 * Algorithm
 * Alpha–beta pruning
 * Alternating sign matrix
 * American Mathematical Society
 * American School for the Deaf
 * Amortized analysis
 * Analysis of algorithms
 * Antinomy
 * Anton Kotzig
 * Any-angle path planning
 * Apple Inc.
 * Approximation algorithm
 * Approximation error
 * Arboricity
 * Arg max
 * Array data structure
 * Art gallery problem
 * Arthur Moritz Schoenflies
 * Arthur Samuel
 * Artificial intelligence
 * Artificial neural network
 * Artificial neuron
 * Asahi Shimbun
 * Asymptotic computational complexity
 * Atomic formula
 * Attribute grammar
 * Australia
 * Autocatalysis
 * 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 of union
 * Axiom schema of replacement
 * Axiom schema of specification
 * B-tree
 * Backtracking
 * Balinski's theorem
 * Barnes & Noble Nook
 * Base unit (measurement)
 * Bayesian network
 * BBC
 * BBVA Foundation Frontiers of Knowledge Award
 * Bellman equation
 * Bellman–Ford algorithm
 * Bernard Bolzano
 * Bernard Chazelle
 * Bernard Roy
 * Bertram Raphael
 * Bertrand Russell
 * Best, worst and average case
 * Best-first search
 * Bianconi–Barabási model
 * Biased graph
 * Bidirectional search
 * Big O notation
 * Bijection
 * Binary heap
 * Binary number
 * Binary relation
 * Bipartite graph
 * Bipolar orientation
 * Birkhoff polytope
 * Bishop (chess)
 * Bitwise operation
 * Blendoku
 * Board game
 * Board representation (chess)
 * Boolean algebra (structure)
 * Boolean-valued model
 * Borel equivalence relation
 * Borel hierarchy
 * Borel set
 * Bose gas
 * Boston
 * Branch and bound
 * Branching factor
 * Branko Grünbaum
 * Breadth-first search
 * Brentford
 * Bridge (graph theory)
 * Brodal queue
 * Broken diagonal
 * Brute-force search
 * Buff (colour)
 * Burali-Forti paradox
 * Burnside's lemma
 * Béla Bollobás
 * California Institute of Technology
 * Camel (chess)
 * Canada
 * Canastota, New York
 * Cantor's paradise
 * Cardinal function
 * Cardinal number
 * Cardinality
 * Carl Friedrich Gauss
 * Carol Vorderman
 * Carsten Thomassen
 * Cartesian product
 * Cartesian product of graphs
 * Case Western Reserve University
 * Category (mathematics)
 * Category theory
 * Cayley table
 * Channel 4
 * Charlie Eppes
 * Checkerboard
 * Cheney's algorithm
 * Chess
 * Chess composer
 * Chess piece
 * Chess set
 * Chordal graph
 * Christian Weise
 * Church–Kleene ordinal
 * Circle
 * Circular definition
 * Citation analysis
 * Citation graph
 * Clarence Irving Lewis
 * Class (set theory)
 * Classical logic
 * Claude Berge
 * Clique (graph theory)
 * Clique problem
 * Clique-width
 * Club set
 * Clustering coefficient
 * Coding theory
 * Coenraad Bron
 * Cofinal (mathematics)
 * Cofinality
 * Cograph
 * Color-coding
 * Combination
 * Combination puzzle
 * Combinatorial explosion
 * Combinatorial optimization
 * Combinatorics
 * Comma category
 * Comparability graph
 * Compiler
 * Complement (set theory)
 * Complement graph
 * Complete bipartite graph
 * Complete coloring
 * Complete graph
 * Computability theory
 * Computable function
 * Computation
 * 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
 * Consistency
 * 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
 * Countable set
 * Counting
 * Covering problems
 * Cream (colour)
 * Crispin Wright
 * Critical path method
 * Crossing number (graph theory)
 * Crossword
 * Cryptography
 * Cube
 * Cube-connected cycles
 * Cumulative hierarchy
 * Currying
 * Cuthill–McKee algorithm
 * CWEB
 * Cycle (graph theory)
 * Cycle detection
 * Cycle double cover
 * Cycle graph
 * Cyclic permutation
 * D*
 * Daily Mail
 * Dancing Links
 * Dartmouth Conferences
 * Data structure
 * Database transaction
 * De Bruijn graph
 * Decision problem
 * Degeneracy (graph theory)
 * Degree (graph theory)
 * Degree distribution
 * Dell Magazines
 * Dense graph
 * Depth-first search
 * Descriptive notation
 * Descriptive set theory
 * Determinant
 * Deterministic finite automaton
 * Diagonally dominant matrix
 * Diagram
 * Diameter
 * Dijkstra's algorithm
 * Directed acyclic graph
 * Directed graph
 * Discrete mathematics
 * Discrete optimization
 * Discrete space
 * Disjoint union
 * 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
 * Donald Knuth
 * Doron Zeilberger
 * Double recursion
 * Doubly linked list
 * Doubly stochastic matrix
 * Dual graph
 * Dual-phase evolution
 * Duality (optimization)
 * Dynamic Bayesian network
 * Dynamic programming
 * Dénes Kőnig
 * Edge (geometry)
 * Edge coloring
 * Edge contraction
 * Edsger W. Dijkstra
 * Edward F. Moore
 * Edward Nelson
 * Effective descriptive set theory
 * Eight queens puzzle
 * Electrical engineering
 * Electrical grid
 * Element (mathematics)
 * Elementary matrix
 * Emeritus
 * Empty set
 * Endre Szemerédi
 * Entitative graph
 * Entropy (information theory)
 * EPL (journal)
 * Epsilon numbers (mathematics)
 * Equivalence class
 * Equivalence relation
 * Erdős–Faber–Lovász conjecture
 * Erdős–Rado theorem
 * Erdős–Rényi model
 * Ernst Zermelo
 * Errett Bishop
 * Euclidean distance
 * Euclidean space
 * Euler diagram
 * Eulerian path
 * Europe
 * Evolving networks
 * Exact cover
 * Exact sequence
 * Existential graph
 * Existential quantification
 * EXIT chart
 * Expander graph
 * Expected value
 * Exponential function
 * Exponential growth
 * Exponentiation
 * Extremal graph theory
 * Facebook
 * Factor graph
 * Factorial
 * Fairy chess piece
 * Faithful representation
 * Fan Chung
 * Fast marching method
 * Fast-growing hierarchy
 * Feature structure
 * Fibonacci cube
 * Fibonacci heap
 * FIDE
 * Finder's fee
 * Finite set
 * Finite state transducer
 * Finite-state machine
 * First-order logic
 * Fisher–Yates shuffle
 * Floor and ceiling functions
 * Flow network
 * Floyd–Steinberg dithering
 * Folded cube graph
 * Forbidden graph characterization
 * Forcing (mathematics)
 * Ford–Fulkerson algorithm
 * Formal system
 * Forward error correction
 * Foundations of mathematics
 * Four color theorem
 * Frank Harary
 * Franklin Medal
 * Frankl–Rödl graph
 * French Academy of Sciences
 * Fringe search
 * Fränkel
 * Function (mathematics)
 * Functor
 * Futoshiki
 * Fuzzy set
 * Gabriel Andrew Dirac
 * Gallai–Hasse–Roy–Vitaver theorem
 * Gallery of named graphs
 * Game Boy Advance
 * Game show
 * Game tree
 * 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
 * Georg Cantor's first set theory article
 * Georg Kreisel
 * George Koltanowski
 * George Pólya
 * Georges Perec
 * Gerhard Ringel
 * Glossary of chess
 * Glossary of graph theory
 * Glossary of set theory
 * Glossary of Sudoku
 * Go (game)
 * Goal node (computer science)
 * God's algorithm
 * Goodstein's theorem
 * Google
 * Gordon Royle
 * Gottfried Wilhelm Leibniz
 * Grace Chisholm Young
 * Grace Murray Hopper Award
 * Graham Brightwell
 * Graham's number
 * Graph (abstract data type)
 * Graph (discrete mathematics)
 * Graph algebra
 * Graph automorphism
 * Graph bandwidth
 * Graph coloring
 * Graph database
 * Graph drawing
 * Graph enumeration
 * Graph equation
 * Graph factorization
 * Graph homomorphism
 * Graph isomorphism
 * Graph labeling
 * Graph minor
 * Graph operations
 * Graph property
 * Graph rewriting
 * Graph sandwich problem
 * Graph theory
 * Graph traversal
 * Graphic Adventure Creator
 * Graphical model
 * Graphon
 * Gray code
 * Greedy algorithm
 * Group action
 * Group theory
 * Groupoid
 * Gustave Choquet
 * H-index
 * Hadwiger conjecture (graph theory)
 * Halved cube graph
 * Hamiltonian path
 * Hamiltonian path problem
 * Hamming distance
 * Hamming graph
 * Hash table
 * Haskell (programming language)
 * Hasse diagram
 * Hassler Whitney
 * Head-driven phrase structure grammar
 * Hebdomada Aenigmatum
 * Henri Lebesgue
 * Henri Poincaré
 * Henry John Stephen Smith
 * Heptomino
 * Herbert A. Simon
 * Herbert Wilf
 * Hereditary set
 * Hermann Zapf
 * Heuristic
 * Heuristic (computer science)
 * Hexadecimal
 * Hexomino
 * Hidato
 * Hidden Markov model
 * Homeomorphism
 * Homotopy type theory
 * Howard Garns
 * Hugo Steinhaus
 * Hyperarithmetical theory
 * Hypercube
 * Hypergraph
 * Hyperoperation
 * IBM 650
 * Ice-type model
 * Idempotence
 * Identity element
 * Identity matrix
 * IEEE John von Neumann Medal
 * If and only if
 * Implicit graph
 * Impredicativity
 * Inaccessible cardinal
 * Incidence matrix
 * Incremental heuristic search
 * Independence (probability theory)
 * Independent set (graph theory)
 * Indian mathematics
 * Indiana
 * Induced subgraph
 * Inference
 * Infimum and supremum
 * Infinitary combinatorics
 * Infinite set
 * Infinity
 * Injective function
 * Inner model theory
 * Institute for Defense Analyses
 * Instruction set
 * Integer
 * Integer programming
 * Internal energy
 * Internal set theory
 * Internet
 * Intersection (road)
 * Intersection (set theory)
 * Intersection graph
 * Intuitionistic logic
 * Invariant (mathematics)
 * Inverse function
 * Inversion (discrete mathematics)
 * Invertible matrix
 * IPhone
 * IPod
 * IS-IS
 * Island algorithm
 * Isomorphism
 * Iterative deepening A*
 * Iterative deepening depth-first search
 * ITunes Store
 * James Joseph Sylvester
 * James Whitbread Lee Glaisher
 * Jan Łukasiewicz
 * Japan
 * Jaroslav Nešetřil
 * Java (programming language)
 * Java applet
 * Jeu de taquin
 * Job shop scheduling
 * John Adrian Bondy
 * John McCarthy (computer scientist)
 * John Venn
 * John von Neumann
 * Johnson's algorithm
 * Joint probability distribution
 * Joseph Madachy
 * Judea Pearl
 * Jump point search
 * K-edge-connected graph
 * K-vertex-connected graph
 * Kakuro
 * Karl Weierstrass
 * KenKen
 * Killer heuristic
 * Killer sudoku
 * King (chess)
 * Kirchhoff's theorem
 * Kleene's algorithm
 * Klein's encyclopedia
 * Knight (chess)
 * Knight's tour
 * Knot theory
 * Knuth Prize
 * 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
 * Kyoto Prize
 * L. R. Ford, Jr.
 * La France (French newspaper)
 * Laplacian matrix
 * Large cardinal
 * Large countable ordinal
 * Latin square
 * Lattice graph
 * Law of excluded middle
 * Layered graph drawing
 * Leonhard Euler
 * Leopold Kronecker
 * Lester R. Ford
 * Level structure
 * Levi graph
 * Lexical semantics
 * Lexicographic breadth-first search
 * Lexicographic product of graphs
 * Lexicographical order
 * Limit ordinal
 * Limit point
 * Line graph
 * Linear programming
 * Linguistics
 * Link (geometry)
 * Link-state routing protocol
 * Linux
 * 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
 * Logarithm
 * Logic
 * Logic programming
 * Logic puzzle
 * Logical conjunction
 * Logical connective
 * Logical disjunction
 * Logical equivalence
 * Logical graph
 * London Underground
 * Longest path problem
 * Longest uncrossed knight's path
 * Loop (graph theory)
 * Los Angeles
 * Lotfi A. Zadeh
 * Low-density parity-check code
 * Ludwig Wittgenstein
 * László Lovász
 * Lévy family of graphs
 * Mad (magazine)
 * Magic square
 * Mainframe computer
 * Maki Kaji
 * Man or boy test
 * Manifold
 * Marginal distribution
 * Maria Chudnovsky
 * Marko Petkovšek
 * Markov chain
 * 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
 * Mathematics of Sudoku
 * Matrix (mathematics)
 * Matrix multiplication
 * Matroid
 * Matthew effect
 * Maven (Scrabble)
 * Max Bezzel
 * Max-flow min-cut theorem
 * Maxima and minima
 * Maximum a posteriori estimation
 * Maximum flow problem
 * Measurable cardinal
 * Mechanical puzzle
 * Median graph
 * Mehdi Behzad
 * Metamath
 * Metric space
 * Min-conflicts algorithm
 * Minesweeper (video game)
 * Minimax
 * Minimum spanning tree
 * Minus Cube
 * MIX
 * Mixed graph
 * MMIX
 * Monotone priority queue
 * Monte Carlo method
 * Moravia
 * Morphism
 * Morse–Kelley set theory
 * MP3
 * MTD-f
 * Multigraph
 * Multiple discovery
 * Multiple edges
 * Multiplication
 * Multiplication table
 * Multiset
 * Möbius configuration
 * N-skeleton
 * Naive set theory
 * National Academy of Sciences
 * National Medal of Science
 * Natural language processing
 * Natural number
 * Nearest neighbour algorithm
 * Negamax
 * Negative number
 * Neighbourhood (graph theory)
 * Neil Robertson (mathematician)
 * Netherlands
 * Network science
 * Network theory
 * Network topology
 * New Foundations
 * New Math
 * Niklaus Wirth
 * Nikoli
 * Nils John Nilsson
 * Nimber
 * Nintendo DS
 * No-three-in-line problem
 * Noga Alon
 * Nokia
 * Non-well-founded set theory
 * Nondeterministic algorithm
 * Nonogram
 * Normal distribution
 * Norwegian Academy of Science and Letters
 * NP-completeness
 * NP-hardness
 * Null graph
 * Numbers (TV series)
 * Octahedron
 * Open Shortest Path First
 * Optimality theory
 * Order isomorphism
 * Order theory
 * Order topology
 * Order type
 * Ordered pair
 * Ordinal arithmetic
 * Ordinal number
 * Oren Patashnik
 * Orientation (graph theory)
 * Otakar Borůvka
 * Oulipo
 * Output-sensitive algorithm
 * P versus NP problem
 * PageRank
 * Pairing heap
 * Pancyclic graph
 * Paradox
 * Parallel computing
 * Parameterized complexity
 * Parity (mathematics)
 * Parity of a permutation
 * Parsing
 * Partial cube
 * Partial permutation
 * Partially ordered set
 * Partition function (mathematics)
 * Partition of a set
 * Pascal (programming language)
 * Path (graph theory)
 * Path graph
 * Pathfinder network
 * Pathfinding
 * Pathwidth
 * Paul Bernays
 * Paul Cohen
 * Paul Erdős
 * Paul Seymour (mathematician)
 * Pawn (chess)
 * Peano axioms
 * Pebble motion problems
 * Pentomino
 * Percolation
 * Percy John Heawood
 * Perfect graph
 * Permutation
 * Permutation group
 * Permutation matrix
 * Persistence (computer science)
 * Peter E. Hart
 * Petersen graph
 * Pixel connectivity
 * Planar graph
 * Playing card
 * PlayStation Portable
 * Ply (game theory)
 * Pointclass
 * Pointless topology
 * Polish space
 * Polygon
 * Polyhedron
 * Polyomino
 * Polytree
 * Portmanteau
 * Positive feedback
 * Positive-definite matrix
 * Potrzebie
 * Power graph analysis
 * Power law
 * Power set
 * Preferential attachment
 * Price's model
 * Prim's algorithm
 * Prime number
 * Primitive recursive function
 * Princeton University
 * Principal variation search
 * Principia Mathematica
 * Principle of compositionality
 * Priority queue
 * Probability
 * Probability distribution
 * Probability mass function
 * Programming language
 * Projective hierarchy
 * Proposition
 * Propositional calculus
 * Pruning (decision trees)
 * Pseudocode
 * Puzzle
 * Puzzle contest
 * Pál Turán
 * Quantifier (logic)
 * Quantum graph
 * Queen (chess)
 * Queue (abstract data type)
 * Quincunx
 * Quiver (mathematics)
 * Quotient group
 * Radio Times
 * Ralph Faudree
 * Ramon Llull
 * Ramsey theory
 * Ramsey's theorem
 * Randolph diagram
 * Random graph
 * Random permutation
 * Random regular graph
 * Random variable
 * Raphael M. Robinson
 * Raster graphics editor
 * Ravindran Kannan
 * Real line
 * Real number
 * Reconstruction conjecture
 * Recreational mathematics
 * Recursion
 * Recursion (computer science)
 * Reduced cost
 * Regular expression
 * Regular graph
 * 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
 * Ronald Graham
 * Rook (chess)
 * Rook polynomial
 * Rotational symmetry
 * Rough set
 * Route inspection problem
 * Routing (electronic design automation)
 * Routing Information Protocol
 * Routing protocol
 * Rubik's Cube
 * Rudrata
 * Rules of chess
 * Rumor spread in social network
 * Russell's paradox
 * Réka Albert
 * Rózsa Péter
 * Sam Loyd
 * San Serriffe
 * Satisfiability
 * Scale-free network
 * Schematic
 * Schulze method
 * Search algorithm
 * Search tree
 * Second-order logic
 * Self-balancing binary search tree
 * Semantic network
 * Sequence
 * Series-parallel graph
 * Set (game)
 * Set (mathematics)
 * Set cover problem
 * Set theory
 * Set-builder notation
 * Set-theoretic topology
 * Seven Bridges of Königsberg
 * Shakey the robot
 * Sharp-P-complete
 * Shortest path problem
 * Shortest-path tree
 * Signed graph
 * Simplex
 * Simplex algorithm
 * Simplicial complex
 * Simulated annealing
 * Sine
 * Six Degrees of Kevin Bacon
 * Sky 1
 * Sliding puzzle
 * SMA*
 * Small-world network
 * Snake-in-the-box
 * Social network
 * Social network analysis
 * Society for Industrial and Applied Mathematics
 * Solomon Feferman
 * Spanning tree
 * Sparse matrix
 * Spectral graph theory
 * Spectral radius
 * Split graph
 * Square root
 * SRI International
 * SSS*
 * Stack (abstract data type)
 * Stained glass
 * Standard 52-card deck
 * Stanford University
 * Stanford University centers and institutes
 * Stanford University School of Engineering
 * State space search
 * Statistical mechanics
 * Statistics
 * Steiner tree problem
 * Stephen Warshall
 * Stigler's law of eponymy
 * Stochastic context-free grammar
 * Stone's representation theorem for Boolean algebras
 * Str8ts
 * Strong orientation
 * Strong perfect graph theorem
 * Strong product of graphs
 * Strongly connected component
 * Strongly regular graph
 * Structure (mathematical logic)
 * Structured programming
 * Subgraph isomorphism problem
 * Subgroup
 * Subroutine
 * Subset
 * Successive over-relaxation
 * Successor function
 * Successor ordinal
 * Sudan function
 * SUDO-Q
 * Sudoku
 * Sudoku Codes
 * Sudoku Cube
 * Sudoku solving algorithms
 * Sumner's conjecture
 * Surjective function
 * Suurballe's algorithm
 * Symmetric graph
 * Symmetric group
 * Symmetric relation
 * Symmetry
 * Symmetry in mathematics
 * Syntax
 * Syracuse, New York
 * Systematic sampling
 * Szemerédi regularity lemma
 * Szymanski's conjecture
 * Tabu search
 * Tarski–Grothendieck set theory
 * Taxicab geometry
 * Technion – Israel Institute of Technology
 * Teletext
 * Tensor product of graphs
 * Tessellation
 * The Age
 * 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
 * The Times
 * Theoretical computer science
 * Thermodynamic free energy
 * Thermodynamics
 * Things a Computer Scientist Rarely Talks About
 * Three cups problem
 * Three utilities problem
 * Tic-tac-toe
 * Time complexity
 * Topological graph theory
 * Topological sorting
 * Topological space
 * Topology
 * Topos
 * Toronto Star
 * Torus
 * Total coloring
 * Total order
 * Tournament (graph theory)
 * Trabb Pardo–Knuth algorithm
 * Trace (linear algebra)
 * Transfinite induction
 * Transitive closure
 * Transitive reduction
 * Transitive set
 * Transposition table
 * Travelling salesman problem
 * Tree (data structure)
 * Tree (graph theory)
 * Tree decomposition
 * Treewidth
 * Trichotomy (mathematics)
 * Truth table
 * Truth value
 * Trémaux tree
 * Tuple
 * Turbo code
 * Turing Award
 * Turing Lecture
 * Turing machine
 * TV Guide
 * Twelvefold way
 * Twitter
 * TwixT
 * U. S. R. Murty
 * Uncountable set
 * Union (set theory)
 * Unit distance graph
 * United States
 * Univalent foundations
 * Universal property
 * Unordered pair
 * Up to
 * Upper set
 * Urelement
 * USA Today
 * Usenet newsgroup
 * Variation (game tree)
 * Variational Bayesian methods
 * Vector space
 * Venn diagram
 * VerbNet
 * Vertex (geometry)
 * Vertex (graph theory)
 * Vertex cover
 * Vertex-transitive graph
 * Veselin Topalov
 * Vinyl
 * Visibility graph
 * Viswanathan Anand
 * Viterbi algorithm
 * Vojtěch Jarník
 * Von Neumann cardinal assignment
 * Von Neumann universe
 * Von Neumann–Bernays–Gödel set theory
 * W. T. Tutte
 * Wadge hierarchy
 * Watch Hill, Rhode Island
 * Watts and Strogatz model
 * Wayne Gould
 * WEB
 * Website
 * Weighted correlation network analysis
 * Well-order
 * Well-ordering principle
 * Well-ordering theorem
 * Wheat and chessboard problem
 * White and Black in chess
 * Widest path problem
 * Wilhelm Ackermann
 * William Henry Young
 * Wood
 * Worcester, Massachusetts
 * WordNet
 * World Chess Championship 2010
 * World Puzzle Championship
 * World Sudoku Championship
 * World War I
 * World Wide Web
 * Wreath product
 * XML
 * Zebra (chess)
 * Zermelo set theory
 * Zermelo–Fraenkel set theory
 * Zero-suppressed decision diagram