TY - JOUR
T1 - Direct product results and the GCD problem, in old and new communication models
AU - Parnafes, Itzhak
AU - Raz, Ran
AU - Wigderson, Avi
PY - 1997
Y1 - 1997
N2 - The interaction between the communication complexity model and 2-prover games model showed how to improve the rate of exponential decrease in the parallel repetition theorem in terms of the communication complexity of the verifier's predicate and applies the improved parallel repetition theorem to the 2-prover games to derive a direct product theorem for communication complexity. A common generalization of the two models initiated a study of considering the GCD problem which exhibits a power gap between the new model and the classical communication complexity model. A complete analysis of the communication complexity of these problems is discussed.
AB - The interaction between the communication complexity model and 2-prover games model showed how to improve the rate of exponential decrease in the parallel repetition theorem in terms of the communication complexity of the verifier's predicate and applies the improved parallel repetition theorem to the 2-prover games to derive a direct product theorem for communication complexity. A common generalization of the two models initiated a study of considering the GCD problem which exhibits a power gap between the new model and the classical communication complexity model. A complete analysis of the communication complexity of these problems is discussed.
UR - http://www.scopus.com/inward/record.url?scp=0030671785&partnerID=8YFLogxK
U2 - 10.1145/258533.258620
DO - 10.1145/258533.258620
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:0030671785
SN - 0734-9025
SP - 363
EP - 372
JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing
JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing
T2 - Proceedings of the 1997 29th Annual ACM Symposium on Theory of Computing
Y2 - 4 May 1997 through 6 May 1997
ER -