On the communication complexity of greater-than

@article{Ramamoorthy2015OnTC,
  title={On the communication complexity of greater-than},
  author={Sivaramakrishnan Natarajan Ramamoorthy and Makrand Sinha},
  journal={2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)},
  year={2015},
  pages={442-444}
}
We give a simple information theoretic proof that the public-coin randomized communication complexity of the greater-than function is Ω(logn) for bit-strings of length n. 

From This Paper

Topics from this paper.
1 Citations
10 References
Similar Papers

Citations

Publications citing this paper.

References

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

Cover and Joy A . Thomas . Elements of Information Theory ( Wiley Series in Telecommunications and Signal Processing )

  • M. Thomas
  • Communication Complexity
  • 2006

The communication complexity of threshold gates

  • Noam Nisan
  • Proceedings of Combinatorics, Paul Erdos is…
  • 1994
1 Excerpt

Similar Papers

Loading similar papers…