• DOI:10.1109/SFCS.2002.1181944
Corpus ID: 9959495

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

View on IEEE

people.seas.harvard.edu

Save to Library

Create Alert

Cite

Launch Research Feed