The Linear-Array Conjecture in Communication Complexity Is False

linear array

network consists of k+1 processors with links only between and (0≤i<k). It is required to compute some boolean function f(x,y) in this network, where initially x is stored at and y is stored at . Let be the (total) number of bits that must be exchanged to compute f in worst case. Clearly, , where D(f) is the standard two-party communication complexity of f. Tiwari proved that for almost all functions and conjectured that this is true for all functions.

In this paper we disprove Tiwari's conjecture, by exhibiting an infinite family of functions for which is essentially at most . Our construction also leads to progress on another major problem in this area: It is easy to bound the two-party communication complexity of any function, given the least number of monochromatic rectangles in any partition of the input space. How tight are such bounds? We exhibit certain functions, for which the (two-party) communication complexity is twice as large as the best lower bound obtainable this way.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received: March 1, 1996

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kushilevitz, E., Linial, N. & Ostrovsky, R. The Linear-Array Conjecture in Communication Complexity Is False. Combinatorica 19, 241–254 (1999). https://doi.org/10.1007/s004930050054

Download citation

  • AMS Subject Classification (1991) Classes:  68Q22, 68Q10, 94A05