💡 Words with a Similar Meaning to "Partition problem"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| partitionnoun | An action which divides a thing into parts, or separates one thing from another. |
| 2-satisfiability | In computer science, 2-satisfiability, 2-SAT or just 2SAT is a computational problem of assigning values to variables, each of which has two possible values, in order to satisfy a system of constraints on pairs of variables. |
| sum of two squares theorem | •Squares (and thus integer distances) in red, and•Non-unique representations (up to rotation and reflection) bolded |
| maximum subarray problem | In computer science, the maximum sum subarray problem, also known as the maximum segment sum problem, is the task of finding a contiguous subarray with the largest sum, within a given one-dimensional array A[1...n] of numbers. |
| binary space partitioning | In computer science, binary space partitioning is a method for space partitioning which recursively subdivides a Euclidean space into two convex sets by using hyperplanes as partitions. |
| partition of a set | In mathematics, a partition of a set is a grouping of its elements into non-empty subsets, in such a way that every element is included in exactly one subset. |
| space partitioning | In geometry, space partitioning is the process of dividing an entire space (usually a Euclidean space) into two or more disjoint subsets (see also partition of a set). |
| subgraph isomorphism problem | In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G and H are given as input, and one must determine whether G contains a subgraph that is isomorphic to H. |
| polygon triangulation | In computational geometry, polygon triangulation is the partition of a polygonal area (simple polygon) into a set of triangles, i.e., finding a set of triangles with pairwise non-intersecting interiors whose union is . |
| circuit satisfiability problem | In theoretical computer science, the circuit satisfiability problem (also known as CIRCUIT-SAT, CircuitSAT, CSAT, etc.) is the decision problem of determining whether a given Boolean circuit has an assignment of its inputs that makes the output true. |
| satisfiability modulo theories | In computer science and mathematical logic, satisfiability modulo theories is the problem of determining whether a mathematical formula is satisfiable. |
| euclidean divisionnoun | (arithmetic) The process of dividing one integer by another to yield a quotient and a remainder smaller than the divisor. |
| stable marriage problemnoun | (mathematics, economics, computer science) The problem of finding a stable matching between two equal-sized sets of elements, given an ordering of preferences for each element. |
| maximal and minimal elements | In mathematics, especially in order theory, a maximal element of a subset of some preordered set is an element of that is not smaller than any other element in . |
| dirichlet's approximation theorem | In number theory, Dirichlet's theorem on Diophantine approximation, also called Dirichlet's approximation theorem, states that for any real numbers and , with , there exist integers and such that and |
| maximum satisfiability problem | In computational complexity theory, the maximum satisfiability problem is the problem of determining the maximum number of clauses, of a given Boolean formula in conjunctive normal form, that can be made true by an assignment of truth values to the variables of the formula. |
| boolean satisfiability problem | In logic and computer science, the (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY, SAT or B-SAT) the problem of determining if there exists an interpretation that satisfies a given Boolean formula. |
| chinese remainder theoremnoun | (number theory) A theorem stating that, if one knows the remainders of the Euclidean division of an integer n by several integers, then one can determine uniquely the remainder of the division of n by the product of these integers, under the condition that the divisors are pairwise coprime. |
| aliquot sum | In number theory, the aliquot sum of a positive integer is the sum of all proper divisors of , that is, all divisors of other than itself. |
| factorization of polynomials | In mathematics and computer algebra, factorization of polynomials or polynomial factorization expresses a polynomial with coefficients in a given field or in the integers as the product of irreducible factors with coefficients in the same domain. |
Translate “Partition problem” into Another Language
Pick a language — the word will be pre-filled in the translator.