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 (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… (More)
DOI: 10.1145/509907.510017

Topics

Statistics

020406080'03'05'07'09'11'13'15'17
Citations per Year

750 Citations

Semantic Scholar estimates that this publication has 750 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Khot2002OnTP, title={On the power of unique 2-prover 1-round games}, author={Subhash Khot}, booktitle={STOC}, year={2002} }