Search Results for ""

A proof which indirectly shows a mathematical object exists without providing a specific example or algorithm for producing an example. Nonconstructive proofs are also called ...

Nonparametric estimation is a statistical method that allows the functional form of a fit to data to be obtained in the absence of any guidance or constraints from theory. As ...

The party problem, also known as the maximum clique problem, asks to find the minimum number of guests that must be invited so that at least m will know each other or at ...

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...

Given an integer e>=2, the Payam number E_+/-(e) is the smallest positive odd integer k such that for every positive integer n, the number k·2^n+/-1 is not divisible by any ...

Pickover's sequence gives the starting positions in the decimal expansion of pi (ignoring the leading 3) in which the first n digits of e occur (counting the leading 2). So, ...

Qubic is a generalization of tic-tac-toe in which players alternately place pieces to get four in a row (rows, columns, pillars, face diagonals, or space diagonals) on a ...

A self-organizing data structure which uses rotations to move any accessed key to the root. This leaves recently accessed nodes near the top of the tree, making them very ...

A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

Given a circular table of diameter 9 feet, which is the minimal number of planks (each 1 foot wide and length greater than 9 feet) needed in order to completely cover the ...