Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:alsoKnownAs |
Minimum Label Cover
|
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:describedBy |
research papers on PCP theorem
|
| gptkbp:field |
theoretical computer science
|
| gptkbp:generalizes |
gptkb:Vertex_Cover
gptkb:Set_Cover |
| gptkbp:goal |
satisfy all constraints with minimum labels
|
| https://www.w3.org/2000/01/rdf-schema#label |
Min-Label Cover
|
| gptkbp:input |
bipartite graph
set of constraints |
| gptkbp:output |
label assignment
|
| gptkbp:reduces |
number of labels assigned
|
| gptkbp:relatedTo |
Constraint Satisfaction Problem
Label Cover |
| gptkbp:usedIn |
gptkb:probabilistically_checkable_proofs
hardness of approximation |
| gptkbp:bfsParent |
gptkb:Label_Cover_problem
|
| gptkbp:bfsLayer |
8
|