Composition theorems in communication complexity

  title={Composition theorems in communication complexity},
  author={Troy Lee and Shengyu Zhang},
A well-studied class of functions in communication complexity are composed functions of the form (f ◦ g)(x, y) = f(g(x, y), . . . , g(x, y)). This is a rich family of functions which encompasses many of the important examples in the literature. It is thus of great interest to understand what properties of f and g affect the communication complexity of (f ◦ g), and in what way. Recently, Sherstov [She09] and independently Shi-Zhu [SZ09b] developed conditions on the inner function g which imply… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS


Publications referenced by this paper.
Showing 1-10 of 34 references

Learning complexity versus communication complexity

  • N. Linial, A. Shraibman
  • Combinatorics, Probability, and Computing, 18:227…
  • 2009
Highly Influential
4 Excerpts

Paul Erdos is Eighty

  • Noam Nisan. The communication complexity of threshold g Combinatorics
  • pages 301–315,
  • 1994
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…