Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:application |
resource allocation
scheduling puzzle solving |
| gptkbp:complexity |
NP-complete
|
| gptkbp:defines |
Given a collection of subsets, does there exist a subcollection that covers every element exactly once?
|
| gptkbp:field |
gptkb:mathematics
computer science |
| gptkbp:generalizes |
set cover problem
|
| gptkbp:hasSpecialCase |
hitting set problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Exact Cover
|
| gptkbp:introduced |
gptkb:Richard_M._Karp
|
| gptkbp:introducedIn |
1972
|
| gptkbp:relatedTo |
gptkb:Latin_square
gptkb:set_theory gptkb:Sudoku combinatorics NP-complete problem polyomino tiling |
| gptkbp:solvedBy |
gptkb:Algorithm_X
gptkb:Dancing_Links |
| gptkbp:bfsParent |
gptkb:Karp's_21_NP-complete_problems
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972) |
| gptkbp:bfsLayer |
6
|