What is Sunrise problem?

The Dutch national flag problem is a computational problem proposed by Edsger Dijkstra. The flag of the Netherlands consists of three colors: red, white, and blue. Given balls of these...

In the analytic theory of continued fractions, the convergence problem is the determination of conditions on the partial numerators ai and partial denominators bi that are sufficient to guarantee the...

In mathematics, the Gauss circle problem is the problem of determining how many integer lattice points there are in a circle centered at the origin and with radius...

In mathematics, and particularly homology theory, Steenrod's Problem is a problem concerning the realisation of homology classes by singular manifolds.

In computational complexity theory, a promise problem is a generalization of a decision problem where the input is promised to belong to a particular subset of all possible inputs. Unlike...

In graph theory and theoretical computer science, the longest path problem is the problem of finding a simple path of maximum length in a given graph. A path is called...

The change-making problem addresses the question of finding the minimum number of coins that add up to a given amount of money. It is a special case of the integer...

In mathematics, the Hurwitz problem is the problem of finding multiplicative relations between quadratic forms which generalise those known to exist between sums of squares in certain numbers of variables.

In computational complexity theory, a nonelementary problem is a problem that is not a member of the class ELEMENTARY. As a class it is sometimes denoted as NONELEMENTARY. Examples of...

In the geometry of convex polytopes, the Minkowski problem for polytopes concerns the specification of the shape of a polytope by the directions and measures of its facets. The theorem...