subset problem
41Kuratowski's closure-complement problem — In the mathematical subject of topology, Kuratowski s closure complement problem refers to the statement that at most 14 distinct sets can be obtained by repeatedly applying the set operations of closure and complement to a given starting subset… …
42Closure problem — A Closure problem is a problem in graph theory for finding a set of vertices in a directed graph such that there are no edges from the set to the rest of the graph. More specifically, the minimum closure problem asks for a set of this type with… …
43Erdős–Graham problem — In combinatorial number theory, the Erdős–Graham problem is the problem of proving that, if the set {2, 3, 4, ...} of integers greater than one is partitioned into finitely many subsets, then one of the subsets can be used to form… …
44Hilbert's tenth problem — is the tenth on the list of Hilbert s problems of 1900. Its statement is as follows:Given a Diophantine equation with any number of unknown quantities and with rational integral numerical coefficients: To devise a process according to which it… …
45Art gallery problem — The art gallery problem or museum problem is a well studied visibility problem in computational geometry. It originates from a real world problem of guarding an art gallery with the minimum number of guards which together can observe the whole… …
46Computational problem — In theoretical computer science, a computational problem is a mathematical object representing a collection of questions that computers might want to solve. For example, the problem of factoring Given a positive integer n, find a nontrivial prime …
47Circle-ellipse problem — The circle ellipse problem in software development (sometimes known as the square rectangle problem) illustrates a number of pitfalls which can arise when using subtype polymorphism in object modelling. The issues are most commonly encountered… …
48Birthday problem — In probability theory, the birthday problem, [This is not a paradox in the sense of leading to a logical contradiction, but is called a paradox because the mathematical truth contradicts naïve intuition: most people estimate that the chance is… …
49Vertex cover problem — In computer science, the vertex cover problem or node cover problem is an NP complete problem and was one of Karp s 21 NP complete problems. It is often used in complexity theory to prove NP hardness of more complicated problems. Definition A… …
50Klee's measure problem — In computational geometry, Klee s measure problem is the problem of determining how efficiently the measure of a union of (multidimensional) rectangular ranges can be computed. Here, a d dimensional rectangular range is defined to be a cartesian… …
