Public vs. private coin flips in one round communication games

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 561-570

  Newman, Ilan ^a   Szegedy, Mario ^b  

^a Haifa U Israel ^*  (Israel)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; GAME THEORY; INFORMATION THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; NETWORK PROTOCOLS; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

COMMUNICATION COMPLEXITY; COMMUNICATION GAMES; GRAPH-THEORETIC; IDENTITY MATRICES; LOW-RANK MATRICES; RANDOM BITS; RANDOMIZED PROTOCOLS;

MATRIX ALGEBRA; COMPUTATIONAL COMPLEXITY;

COMMUNICATION COMPLEXITY; PRIVATE BITS MODEL;

EID: 0029706950     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.238004     Document Type: Conference Paper

References (8)

1. J. Bourgain and A. Wigderson, Personal communication.
2. I. Kremer, N Nissan, D. Ron, On Randomized One-Round Communication Complexity, STOC95.
3. E. Kuchilevitz, N. Nisan, A survey on Communication Complexity, manuscript 1995.
4. L. Lovász, Communication complexity: a survey, in Path flowers and VLSI, (Ed, B. Korte, L. Lovász, A. Schrijver,), Springer Verlag, 1990.
5. I. Newman, Private vs. Common Random bits in communication complexity, Information Processing Letters 39 (1991) 67-71.
6. M. Yannakakis, Expressing combinatorial optimization problems by linear programs, STOC, 1988 pp. 223-228.
7. A. C. Yao, Probabilistic computation, towards a unified measure of complexity, Proc. 18th IEEE Symp. on Foundation of Computer Science, (1977), pp. 222-227.
8. A. C. Yao, Some complexity questions related to distributive computing, STOC, 1979, pp. 209-213.