Direct product results and the GCD problem, in old and new communication models

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1997, Pages 363-372

  Parnafes, Itzhak ^a   Raz, Ran ^a   Wigderson, Avi ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; GAME THEORY; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; PROBABILITY; PROBLEM SOLVING; THEOREM PROVING;

COMMUNICATION COMPLEXITY; PARALLEL REPETITION THEOREM;

COMPUTATIONAL COMPLEXITY;

EID: 0030671785     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/258533.258620     Document Type: Conference Paper

References (18)