Information | |
---|---|
has gloss | eng: In computational complexity theory, the Unique Games Conjecture is a conjecture made by Subhash Khot in 2002. The conjecture postulates the NP-hardness of the problem of determining the value of a certain type of game known as a unique game. It has applications in the theory of hardness of approximation. |
lexicalization | eng: unique games conjecture |
instance of | (noun) a hypothesis that has been formed by speculating or conjecturing (usually with little hard evidence); "speculations about the outcome of the election"; "he dismissed it as mere conjecture" conjecture, speculation |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint