Search Results for ""

There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...

Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...

To enumerate a set of objects satisfying some set of properties means to explicitly produce a listing of all such objects. The problem of determining or counting all such ...

The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...

A Hamiltonian path, also called a Hamilton path, is a graph path between two vertices of a graph that visits each vertex exactly once. If a Hamiltonian path exists whose ...

Define g(k) as the quantity appearing in Waring's problem, then Euler conjectured that g(k)=2^k+|_(3/2)^k_|-2, where |_x_| is the floor function.

The recurrence relation E_n=E_2E_(n-1)+E_3E_(n-2)+...+E_(n-1)E_2 which gives the solution to Euler's polygon division problem.

Determination of whether predicate P(x_1,...,x_n) is true or false for any given values of x_1, ..., x_n is called its decision problem. The decision problem for predicate ...

Conditions at an initial time t=t_0 from which a given set of mathematical equations or physical system evolves. A system with initial conditions specified is known as an ...

A type of cryptography in which the encoding key is revealed without compromising the encoded message. The two best-known methods are the knapsack problem and RSA encryption.