Sciweavers

STOC
1997
ACM
116views Algorithms» more  STOC 1997»
13 years 11 months ago
Direct Product Results and the GCD Problem, in Old and New Communication Models
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:
Itzhak Parnafes, Ran Raz, Avi Wigderson