Statements (25)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:abbreviation |
gptkb:UGC
|
| gptkbp:concerns |
hardness of approximation
unique games |
| gptkbp:field |
gptkb:theoretical_computer_science
|
| gptkbp:implies |
optimality of certain approximation algorithms
hardness of approximating some optimization problems |
| gptkbp:influenced |
approximation algorithms
complexity of constraint satisfaction problems |
| gptkbp:proposedBy |
gptkb:Subhash_Khot
2002 |
| gptkbp:relatedTo |
gptkb:2-to-2_games_conjecture
gptkb:Goemans–Williamson_algorithm gptkb:Label_Cover_problem gptkb:Max-Cut_problem gptkb:PCP_theorem gptkb:NP-hardness semidefinite programming |
| gptkbp:status |
open
|
| gptkbp:bfsParent |
gptkb:Subhash_Khot
gptkb:Complexity_theory gptkb:probabilistically_checkable_proofs gptkb:Sum-of-Squares_algorithm |
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Unique Games Conjecture
|