## Abstract

A linear array network consists of k + 1 processors P_{0}, P_{1},..., P_{k} with links only between Pi and P_{i+i} (0 ≤ i < k). It is required to compute some boolean function f(x, y) in this network, where x is initially stored at P_{0} and y at P_{k}. Let D_{k}(f) be the (total) number of bits that must be exchanged to compute/in worst case. Clearly, D_{k}(f) ≤ k · D(f), where D(f) is the standard two-party communication complexity of/. Tiwari proved that for almost all functions D_{k}(f) ≥ k(D(f) - 0(1)) 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 D_{k}(f) is essentially at most 3/4k · D(f). This 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 larger than the best lower bound obtainable this way.

Original language | English |
---|---|

Title of host publication | Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996 |

Publisher | Association for Computing Machinery |

Pages | 1-10 |

Number of pages | 10 |

ISBN (Electronic) | 0897917855 |

DOIs | |

State | Published - 1 Jul 1996 |

Event | 28th Annual ACM Symposium on Theory of Computing, STOC 1996 - Philadelphia, United States Duration: 22 May 1996 → 24 May 1996 |

### Publication series

Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|

Volume | Part F129452 |

ISSN (Print) | 0737-8017 |

### Conference

Conference | 28th Annual ACM Symposium on Theory of Computing, STOC 1996 |
---|---|

Country/Territory | United States |

City | Philadelphia |

Period | 22/05/96 → 24/05/96 |

### Bibliographical note

Publisher Copyright:© 1996 ACM.