The linear-array conjecture in communication complexity is false

Combinatorica

Volumn 19, Issue 2, 1999, Pages 241-254

  Kushilevitz, Eyal ^a   Linial, Nathan ^c   Ostrovsky, Rafail ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TELCORDIA TECHNOLOGIES   (United States)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040113670     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930050054     Document Type: Article

References (21)

1. A. AHO, J. ULLMAN, and M. YANNAKAKIS: On notions of information transfer in VLSI circuits, Proc. 15th STOC, 133-139, 1983.
2. M. DIETZFELBINGER: The linear-array problem in communication complexity resolved, Proc. 29th STOC, 373-382, 1997.
3. P. DURIS, Z. GALIL, and G. SCHNITGER: Lower bounds on communication complexity, Information and Computation, 73(1) (1987), 1-22. (Early version in Proc. 16th STOC, 81-91, 1984.)
4. P. DURIS, Z. GALIL, and G. SCHNITGER: Lower bounds on communication complexity, Information and Computation, 73(1) (1987), 1-22. (Early version in Proc. 16th STOC, 81-91, 1984.)
5. P. FRANKL, and R. M. WILSON: Intersection theorems with geometric consequences, Combinatorica, 1 (1981), 357-368.
6. M. KARCHMER, E. KUSHILEVITZ, and N. NISAN: Fractional covers and communication complexity, SIAM J. Discrete Math., 8(1), (1995), 76-92. (Early version in 7th IEEE Structure in Complexity Theory, (1992), 262-274.)
7. M. KARCHMER, E. KUSHILEVITZ, and N. NISAN: Fractional covers and communication complexity, SIAM J. Discrete Math., 8(1), (1995), 76-92. (Early version in 7th IEEE Structure in Complexity Theory, (1992), 262-274.)
8. E. KUSHILEVITZ and N. NISAN: Communication Complexity, Cambridge University Press, 1997.
9. R. J. LIPTON and R. SEDGEWICK: Lower bounds for VLSI, Proc. 13th STOC, 300-307, 1981.
10. K. MEHLHORN and E. SCHMIDT: Las-Vegas is better than determinism in VLSI and distributed computing, Proc. 14th STOC, 330-337, 1982.
11. N. NISAN and A. WIGDERSON: Rounds in communication complexity revisited, SIAM J. Computing, 22(1) (1993), 211-219. (Early version in Proc. 23rd STOC, 419-429, 1991.)
12. N. NISAN and A. WIGDERSON: Rounds in communication complexity revisited, SIAM J. Computing, 22(1) (1993), 211-219. (Early version in Proc. 23rd STOC, 419-429, 1991.)
13. N. NISAN and A. WIGDERSON: On rank vs. communication complexity, Combinatorica, 15(4) (1995), 557-566. (Early version in Proc. 35th FOCS, 831-836, 1994.)
14. N. NISAN and A. WIGDERSON: On rank vs. communication complexity, Combinatorica, 15(4) (1995), 557-566. (Early version in Proc. 35th FOCS, 831-836, 1994.)
15. C. PAPADIMITRIOU and M. SIPSER: Communication complexity, JCSS, 28(2) (1984), 260-269. (Early version in Proc. 14th STOC, 196-200, 1982.)
16. C. PAPADIMITRIOU and M. SIPSER: Communication complexity, JCSS, 28(2) (1984), 260-269. (Early version in Proc. 14th STOC, 196-200, 1982.)
17. R. RAZ and B. SPIEKER: On the "log rank" conjecture in communication complexity, Combinatorica, 15(4) (1995), 567-588. (Early version in Proc. 34th FOCS, 168-176, 1993.)
18. R. RAZ and B. SPIEKER: On the "log rank" conjecture in communication complexity, Combinatorica, 15(4) (1995), 567-588. (Early version in Proc. 34th FOCS, 168-176, 1993.)
19. P. TIWARI: Lower bounds on communication complexity in distributed computer networks, JACM, 34(4) (1987), 921-938. (Early version in Proc 25th FOCS, 109-117, 1984.)
20. P. TIWARI: Lower bounds on communication complexity in distributed computer networks, JACM, 34(4) (1987), 921-938. (Early version in Proc 25th FOCS, 109-117, 1984.)
21. A. C. YAO: Some complexity questions related to distributed computing, Proc. 11th STOC, 209-213, 1979.