Composition Theorems in Communication Complexity

@article{Lee2010CompositionTI,
  title={Composition Theorems in Communication Complexity},
  author={T. Lee and Shengyu Zhang},
  journal={ArXiv},
  year={2010},
  volume={abs/1003.1443}
}
  • T. Lee, Shengyu Zhang
  • Published 2010
  • Mathematics, Computer Science, Physics
  • ArXiv
  • A well-studied class of functions in communication complexity are composed functions of the form (f o gn)(x, y) = f(g(x1, y1),..., g(xn, yn)). 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 o gn), and in what way. Recently, Sherstov [She09] and independently Shi-Zhu [SZ09b] developed conditions on the inner function g which… CONTINUE READING
    31 Citations
    Efficient quantum protocols for XOR functions
    • 17
    • PDF
    Quantum and randomized communication complexity of XOR functions in the SMP model
    • 13
    Rectangles Are Nonnegative Juntas
    • 95
    • PDF
    Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models
    • 7
    The Log-Rank Conjecture for Read- k XOR Functions
    • 1
    Lower Bounds in Communication Complexity
    • 53
    • PDF
    Amplification of One-Way Information Complexity via Codes and Noise Sensitivity
    • 5
    • PDF
    Linear Sketching over F_2
    • 9
    • PDF

    References

    SHOWING 1-10 OF 46 REFERENCES
    Quantum communication complexity of block-composed functions
    • 81
    • Highly Influential
    • PDF
    The Unbounded-Error Communication Complexity of Symmetric Functions
    • Alexander A. Sherstov
    • Computer Science, Mathematics
    • 2008 49th Annual IEEE Symposium on Foundations of Computer Science
    • 2008
    • 46
    • PDF
    Quantum lower bounds by polynomials
    • 327
    • PDF
    Lower Bounds in Communication Complexity
    • 53
    • PDF
    Exponential separation of quantum and classical communication complexity
    • R. Raz
    • Computer Science
    • STOC '99
    • 1999
    • 242
    On quantum-classical equivalence for composed communication problems
    • 12
    • Highly Influential
    • PDF
    A Direct Product Theorem for Discrepancy
    • 83
    • PDF
    Multiparty Communication Complexity of Disjointness
    • 90
    • PDF
    Communication complexities of symmetric XOR functions
    • 41
    Circuits, communication and polynomials
    • 20