Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complexity |
NP
|
| gptkbp:concerns |
graph
permutations label assignment |
| gptkbp:field |
theoretical computer science
|
| gptkbp:hasConjecture |
gptkb:Unique_Games_Conjecture
|
| gptkbp:hasSpecialCase |
gptkb:Label_Cover_problem
Max Cut problem |
| https://www.w3.org/2000/01/rdf-schema#label |
Unique Games problem
|
| gptkbp:importantFor |
hardness of approximation
|
| gptkbp:influenced |
approximation algorithms
hardness results |
| gptkbp:introduced |
gptkb:Subhash_Khot
|
| gptkbp:introducedIn |
2002
|
| gptkbp:openQuestion |
Unique Games Conjecture validity
polynomial-time solvability |
| gptkbp:relatedTo |
gptkb:Unique_Games_Conjecture
|
| gptkbp:solvedBy |
semidefinite programming (SDP) relaxations
|
| gptkbp:type |
Boolean satisfiability problem
|
| gptkbp:usedIn |
gptkb:complexity_theory
algorithm design |
| gptkbp:bfsParent |
gptkb:Label_Cover_problem
|
| gptkbp:bfsLayer |
8
|