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.

In two dimensions, there are two periodic circle packings for identical circles: square lattice and hexagonal lattice. In 1940, Fejes Tóth proved that the hexagonal lattice ...

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.

The concept of "random close packing" was shown by Torquato et al. (2000) to be mathematically ill-defined idea that is better replaced by the notion of "maximally random ...