Direct Product Results and the GCD Problem, in Old and New Communication Models

@inproceedings{Parnafes1997DirectPR,
  title={Direct Product Results and the GCD Problem, in Old and New Communication Models},
  author={Itzhak Parnafes and Ran Raz and Avi Wigderson},
  booktitle={STOC},
  year={1997}
}
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models: 1. We show how to improve the rate of exponential decrease in the parallel repetition theorem of [Ra] in terms of the communication complexity of the verifier's predicate. 2. We apply the improved parallel repetition theorem of 2-prover games to derive, for the first time, a direct product theorem for communication complexity. The… CONTINUE READING
Highly Cited
This paper has 63 citations. REVIEW CITATIONS

Topics

Statistics

01020'00'02'04'06'08'10'12'14'16'18
Citations per Year

63 Citations

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

See our FAQ for additional information.