An information statistics approach to data stream and communication complexity

@article{BarYossef2002AnIS,
  title={An information statistics approach to data stream and communication complexity},
  author={Ziv Bar-Yossef and T. S. Jayram and Ravi Kumar and D. Sivakumar},
  journal={The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.},
  year={2002},
  pages={209-218}
}
  • Ziv Bar-Yossef, T. S. Jayram, +1 author D. Sivakumar
  • Published 2002
  • Mathematics, Computer Science
  • The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
  • We present a new method for proving strong lower bounds in communication complexity. This method is based on the notion of the conditional information complexity of a function which is the minimum amount of information about the inputs that has to be revealed by a communication protocol for the function. While conditional information complexity is a lower bound on the communication complexity, we show that it also admits a direct sum theorem. Direct sum decomposition reduces our task to that of… CONTINUE READING
    408 Citations

    Topics from this paper

    On Information Complexity in the Broadcast Model
    • 14
    • Highly Influenced
    • PDF
    Exponential Separation of Information and Communication
    • A. Ganor, Gillat Kol, R. Raz
    • Mathematics, Computer Science
    • 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
    • 2014
    • 64
    • PDF
    Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
    • 14
    • PDF
    CS 2429-Foundations of Communication Complexity Lecturer :
    • Highly Influenced
    • PDF
    Kolmogorov complexity and combinatorial methods in communication complexity
    • 3
    • PDF
    Multi-Party Protocols, Information Complexity and Privacy
    • 2
    • PDF
    Multi-Party Protocols, Information Complexity and Privacy
    • 4
    • PDF
    From information to exact communication
    • 80
    • PDF
    Communication Complexity of Statistical Distance
    • Thomas Watson
    • Mathematics, Computer Science
    • Electron. Colloquium Comput. Complex.
    • 2016
    • 7
    • PDF

    References

    SHOWING 1-10 OF 37 REFERENCES
    Information theory methods in communication complexity
    • 75
    Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity
    • F. Ablayev
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 1996
    • 87
    Two applications of information complexity
    • 86
    Informational complexity and the direct sum problem for simultaneous message complexity
    • 263
    • PDF
    Super-logarithmic depth lower bounds via direct sum in communication complexity
    • 75
    A parallel repetition theorem
    • R. Raz
    • Mathematics, Computer Science
    • STOC '95
    • 1995
    • 620
    On Randomized One-round Communication Complexity
    • 172
    Near-optimal lower bounds on the multi-party communication complexity of set disjointness
    • 199
    • PDF
    The Communication Complexity of Efficient Allocation Problems
    • 62
    • PDF
    Privacy, additional information and communication
    • 61
    • PDF