Search Results for ""

A problem is NP-hard if an algorithm for solving it can be translated into one for solving any NP-problem (nondeterministic polynomial time) problem. NP-hard therefore means ...

A problem is assigned to the P (polynomial time) class if there exists at least one algorithm to solve that problem, such that the number of steps of the algorithm is bounded ...

A problem in the theory of algebraic invariants that was solved by Hilbert using an existence proof.

The problem of deciding if two knots in three-space are equivalent such that one can be continuously deformed into another.

Hansen's problem is a problem in surveying described as follows. From the position of two known but inaccessible points A and B, determine the position of two unknown ...

The problem of deciding if four colors are sufficient to color any map on a plane or sphere.

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 problem of finding all independent irreducible algebraic relations among any finite set of quantics.

A problem posed by L. Collatz in 1937, also called the 3x+1 mapping, 3n+1 problem, Hasse's algorithm, Kakutani's problem, Syracuse algorithm, Syracuse problem, Thwaites ...

Suppose A and B are candidates for office and there are 2n voters, n voting for A and n for B. In how many ways can the ballots be counted so that B is never ahead of A? The ...