Construct · 1 fields · 1 citations

unique games conjecture: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
unique gamesconjecture1 CONSTRUCTUnique games conjectureKHOT · COMPUTATIONAL

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational complexity

the conjecture that approximating the value of a certain constraint game is NP-hard, which would fix optimal approximation ratios for many problems.

In computational complexity, unique games conjecture refers to the conjecture that approximating the value of a certain constraint game is NP-hard, which would fix optimal approximation ratios for many problems. This meaning comes from Khot (2002) in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how unique games conjecture sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

complexity4 fields · 7 citationsjingle · one word, four constructsgame2 fields · 3 citationsjingle · one word, two constructsvalue6 fields · 12 citationsjingle · one name, six constructs

References

  1. Khot, S. (2002). On the power of unique 2-prover 1-round games. Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. https://doi.org/10.1145/509907.510017

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct