Unique Games Conjecture

The unique games conjecture states that for every sufficiently small pair of constants ε, δ > 0, there exists a constant k such that the following promise problem (Lyes, Lno) is NP-hard:

  • Lyes = {G: the value of G is at least 1 − δ}
  • Lno = {G: the value of G is at most ε}

where G is a unique game whose answers come from a set of size k.

Read more about Unique Games Conjecture:  Relevance, Discussion and Alternatives

Famous quotes containing the words unique, games and/or conjecture:

    An actor must communicate his author’s given message—comedy, tragedy, serio- comedy; then comes his unique moment, as he is confronted by the looked-for, yet at times unexpected, reaction of the audience. This split second is his; he is in command of his medium; the effect vanishes into thin air; but that moment has a power all its own and, like power in any form, is stimulating and alluring.
    Eleanor Robson Belmont (1878–1979)

    Intelligence and war are games, perhaps the only meaningful games left. If any player becomes too proficient, the game is threatened with termination.
    William Burroughs (b. 1914)

    There is something fascinating about science. One gets such wholesale returns of conjecture out of such a trifling investment of fact.
    Mark Twain [Samuel Langhorne Clemens] (1835–1910)