combinatorial game
111Random permutation statistics — The statistics of random permutations, such as the cycle structure of a random permutation are of fundamental importance in the analysis of algorithms, especially of sorting algorithms, which operate on random permutations. Suppose, for example,… …
112Sudoku — Not to be confused with Sodoku. A Sudoku puzzle …
113Lists of mathematics topics — This article itemizes the various lists of mathematics topics. Some of these lists link to hundreds of articles; some link only to a few. The extremely long list of mathematics articles contains all mathematical articles in alphabetical order.… …
114Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …
115Richard Garfield — Richard Channing Garfield, Jr. (born 26 June 1963 in Philadelphia, Pennsylvania) is a mathematics professor and game designer who created the card games , Netrunner , BattleTech , (originally known as Jyhad ), The Great Dalmuti , Star Wars… …
116Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …
117Dual problem — In constrained optimization, it is often possible to convert the primal problem (i.e. the original form of the optimization problem) to a dual form, which is termed a dual problem. Usually dual problem refers to the Lagrangian dual problem but… …
118Mathematical economics — Economics …
119Gaming mathematics — Gaming mathematics, also referred to as the mathematics of gambling, is a collection of probability applications encountered in games of chance and can be included in applied mathematics. From mathematical point of view, the games of chance are… …
120Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …
