Randomized simultaneous messages: Solution of a problem of Yao in communication complexity

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1997, Pages 239-246

  Babai, L ^a   Kimmel, P G ^a  

^a THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR ALGEBRA;

COMMUNICATION COMPLEXITY; COMMUNICATION GAMES; COMMUNICATION MODELING; COMPUTATIONAL POWER; CONSTRUCTIVE PROOF; LOWER-BOUND PROOFS; PROBABILISTIC METHODS; SIMULTANEOUS MESSAGES;

COMPUTATIONAL COMPLEXITY;

EID: 84983741260     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1997.612319     Document Type: Conference Paper

References (15)

1. N. Alon and J. Spencer. The Probabilistic Method. John Wiley & Sons, Inc, 1992.
2. A. Ambainis. Communication complexity in a 3-computer model. Algorithmica, 16 (3): 298-301, 1996.
3. A. Ambainis. Upper bounds on multiparty communication complexity of shifts. Proceedings of the 13th Symposium on Theoretical Aspects of Computer Science, pages 631-642, 1996.
4. L. Babai and P. Frankl. Linear Algebra Methods in Combinatorics, Parti. Preliminary Version, 1992.
5. L. Babai, P. Kimmel, and S. V. Lokam. Simultaneous messages vs. communication. Proceedings of the 12th Symposium on Theoretical Aspects of Computer Science, pages 361-372, 1995.
6. J. Bourgain and A. Wigderson. Private communication by Avi Wigderson, March, 1996.
7. I. Kremer, N. Nisan, and D. Ron. On randomized one-round communication complexity. Proceedings of the 27th ACM Symposium on the Theory of Computing, pages 596-605, 1995.
8. L. Lovasz. Communication complexity: A survey. Technical Report CS-TR-204-89, Department of Computer Science, Princeton University, 1989.
9. M. Naor. Private communication, cited in[7], 1994.
10. I. Newman. Private vs common random bits in communication complexity. Information Processing Letters, 39: 67-71, 1991.
11. I. Newman. Private communication, cited in [7], 1994.
12. I. Newman and M. Szegedy. Public vs private coin flips in one round communication games. Proceedings of the 28th ACM Symposium on the Theory of Computing, pages 561-570, 1996.
13. N. Nisan and A. Wigderson. Rounds in communication complexity revisited. SIAM Journal on Computing, 22 (1): 211-219, 1993.
14. P. Pudlak, V. Rodl, and J. Sgall. Boolean circuits, tensor ranks and communication complexity. To apear in SIAM Journal on Computing, 26 (3), 1996.
15. A. C.-C. Yao. Some complexity questions related to distributive computing. Proceedings of the 11th ACM Symposium on the Theory of Computing, pages 209-213, 1979.