On the power of unique 2-prover 1-round games

@inproceedings{Khot2002OnTP,
  title={On the power of unique 2-prover 1-round games},
  author={Subhash Khot},
  booktitle={STOC '02},
  year={2002}
}
  • Subhash Khot
  • Published in STOC '02 2002
  • Mathematics, Computer Science
A 2-prover game is called unique if the answer of one prover uniquely determines the answer of the second prover and vice versa (we implicitly assume games to be one round games). The value of a 2-prover game is the maximum acceptance probability of the verifier over all the prover strategies. We make the following conjecture regarding the power of unique 2-prover games, which we call the Unique Games Conjecture:(MATH) The Unique Games Conjecture: For arbitrarily small constants $ \ \zeta… Expand
474 Citations
A note on Unique Games
Unique Games with Entangled Provers are Easy
Unique Games with Entangled Provers are Easy
On the power of many one-bit provers
Refuting Unique Game Conjecture and d-to-1 Conjecture
NP-Hardness of Approximately Solving Linear Equations over Reals
A Counterexample to Strong Parallel Repetition
  • R. Raz
  • Mathematics, Computer Science
  • FOCS
  • 2008
...
1
2
3
4
5
...

References

Clique is hard to approximate within n/sup 1-/spl epsiv//
  • J. Håstad
  • Mathematics, Computer Science
  • Proceedings of 37th Conference on Foundations of Computer Science
  • 1996