Exact Cover problem
E1466149
UNEXPLORED
The Exact Cover problem is a classic NP-complete decision problem in combinatorics and computer science that asks whether a collection of subsets contains a subcollection that covers each element of a universe exactly once.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Exact Cover by 3-Sets problem | 1 |
| Exact Cover problem canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T21088254 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Exact Cover problem Context triple: [Reducibility Among Combinatorial Problems, establishesNPCompletenessOf, Exact Cover problem]
-
A.
Boolean satisfiability problem
The Boolean satisfiability problem (SAT) is the canonical NP-complete decision problem of determining whether there exists an assignment of truth values to variables that makes a given Boolean formula evaluate to true.
-
B.
Clique problem
The Clique problem is a classic NP-complete decision problem in graph theory that asks whether a graph contains a fully connected subgraph (clique) of at least a given size.
-
C.
A Combinatorial Problem
"A Combinatorial Problem" is a classic mathematical paper by N. G. de Bruijn that introduces and analyzes a fundamental counting problem in combinatorics.
-
D.
Subset sum problem
The subset sum problem is a classic NP-complete decision problem in computer science that asks whether any subset of given integers sums to a specified target value.
-
E.
Packing and Covering
"Packing and Covering" is a classic mathematical monograph by C. A. Rogers that systematically develops the theory of packing and covering problems in geometry and number theory.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Exact Cover problem Target entity description: The Exact Cover problem is a classic NP-complete decision problem in combinatorics and computer science that asks whether a collection of subsets contains a subcollection that covers each element of a universe exactly once.
-
A.
Boolean satisfiability problem
The Boolean satisfiability problem (SAT) is the canonical NP-complete decision problem of determining whether there exists an assignment of truth values to variables that makes a given Boolean formula evaluate to true.
-
B.
Clique problem
The Clique problem is a classic NP-complete decision problem in graph theory that asks whether a graph contains a fully connected subgraph (clique) of at least a given size.
-
C.
A Combinatorial Problem
"A Combinatorial Problem" is a classic mathematical paper by N. G. de Bruijn that introduces and analyzes a fundamental counting problem in combinatorics.
-
D.
Subset sum problem
The subset sum problem is a classic NP-complete decision problem in computer science that asks whether any subset of given integers sums to a specified target value.
-
E.
Packing and Covering
"Packing and Covering" is a classic mathematical monograph by C. A. Rogers that systematically develops the theory of packing and covering problems in geometry and number theory.
- F. None of above. chosen
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject linked to:
"Reducibility Among Combinatorial Problems" (1972)
Reducibility Among Combinatorial Problems
→
establishesNPCompletenessOf
→
Exact Cover by 3-Sets problem
ⓘ
subject linked to:
"Reducibility Among Combinatorial Problems" (1972)
linked to: Exact Cover problem