Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:theoretical_computer_science
|
| gptkbp:application |
puzzle solving
sudoku polyomino tiling |
| gptkbp:complexity |
NP-complete
|
| gptkbp:definedIn |
Given a set and a collection of its subsets, does there exist a subcollection that partitions the set?
|
| gptkbp:field |
gptkb:mathematics
computer science |
| gptkbp:introduced |
gptkb:Donald_Knuth
|
| gptkbp:introducedIn |
1970s
|
| gptkbp:relatedTo |
gptkb:Boolean_satisfiability_problem
gptkb:XOR-SAT set cover problem |
| gptkbp:solvedBy |
gptkb:Algorithm_X
gptkb:Dancing_Links |
| gptkbp:bfsParent |
gptkb:NP_languages
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Exact cover problem
|