|
gptkbp:instanceOf
|
gptkb:theoretical_computer_science
gptkb:NP-complete_problem
|
|
gptkbp:alsoKnownAs
|
gptkb:X3C
|
|
gptkbp:category
|
gptkb:mathematical_optimization
gptkb:Set_theory
NP-complete problems
|
|
gptkbp:definedIn
|
gptkb:theoretical_computer_science
|
|
gptkbp:exactCoverDefinition
|
A subcollection C' of C such that every element of X occurs in exactly one member of C'
|
|
gptkbp:input
|
collection C of 3-element subsets of X
finite set X
|
|
gptkbp:NP-complete
|
yes
|
|
gptkbp:NP-completenessProvedBy
|
gptkb:Richard_M._Karp
|
|
gptkbp:NP-completenessProvedIn
|
1972
|
|
gptkbp:reduces
|
gptkb:3SAT
gptkb:Sudoku
gptkb:Set_Cover
polyomino tiling
|
|
gptkbp:relatedTo
|
gptkb:Set_Cover_Problem
Hitting Set Problem
Exact Cover Problem
|
|
gptkbp:subsetSize
|
3
|
|
gptkbp:type
|
Does C contain an exact cover for X?
|
|
gptkbp:usedIn
|
gptkb:theoretical_computer_science
gptkb:complexity_theory
algorithm design
|
|
gptkbp:bfsParent
|
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972)
|
|
gptkbp:bfsLayer
|
6
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Exact Cover by 3-Sets
|