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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A 2-prover game is called unique if the answer of one prover uniquely determines the answer of the second prover and vice versa. The value of a 2-prover game is the maximum acceptance probability of the verifier over all the prover strategies. Thus, the following conjecture regarding the power of unique 2-prover games, which is called the Unique Games Conjecture is made.

Original languageEnglish (US)
Title of host publicationConference Proceedings of the Annual ACM Symposium on Theory of Computing
Pages767-775
Number of pages9
StatePublished - 2002
EventProceedings of the 34th Annual ACM Symposium on Theory of Computing - Montreal, Que., Canada
Duration: May 19 2002May 21 2002

Other

OtherProceedings of the 34th Annual ACM Symposium on Theory of Computing
CountryCanada
CityMontreal, Que.
Period5/19/025/21/02

ASJC Scopus subject areas

  • Software

Cite this

Khot, S. (2002). On the power of unique 2-prover 1-round games. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 767-775)

On the power of unique 2-prover 1-round games. / Khot, Subhash.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2002. p. 767-775.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Khot, S 2002, On the power of unique 2-prover 1-round games. in Conference Proceedings of the Annual ACM Symposium on Theory of Computing. pp. 767-775, Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montreal, Que., Canada, 5/19/02.
Khot S. On the power of unique 2-prover 1-round games. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2002. p. 767-775
Khot, Subhash. / On the power of unique 2-prover 1-round games. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2002. pp. 767-775
@inproceedings{311eb82ec77c4b24b38b88fca4ddf6eb,
title = "On the power of unique 2-prover 1-round games",
abstract = "A 2-prover game is called unique if the answer of one prover uniquely determines the answer of the second prover and vice versa. The value of a 2-prover game is the maximum acceptance probability of the verifier over all the prover strategies. Thus, the following conjecture regarding the power of unique 2-prover games, which is called the Unique Games Conjecture is made.",
author = "Subhash Khot",
year = "2002",
language = "English (US)",
pages = "767--775",
booktitle = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

}

TY - GEN

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

AU - Khot, Subhash

PY - 2002

Y1 - 2002

N2 - A 2-prover game is called unique if the answer of one prover uniquely determines the answer of the second prover and vice versa. The value of a 2-prover game is the maximum acceptance probability of the verifier over all the prover strategies. Thus, the following conjecture regarding the power of unique 2-prover games, which is called the Unique Games Conjecture is made.

AB - A 2-prover game is called unique if the answer of one prover uniquely determines the answer of the second prover and vice versa. The value of a 2-prover game is the maximum acceptance probability of the verifier over all the prover strategies. Thus, the following conjecture regarding the power of unique 2-prover games, which is called the Unique Games Conjecture is made.

UR - http://www.scopus.com/inward/record.url?scp=0036040281&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036040281&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0036040281

SP - 767

EP - 775

BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

ER -