Editing Communication complexity (section)

== References ==
* {{cite book | last1=Rao | first1=Anup | last2=Yehudayoff | first2=Amir | title=Communication complexity and applications| publisher=Cambridge University Press | location=Cambridge | year=2020 | isbn=9781108671644 }}
* {{cite book | last1=Kushilevitz | first1=Eyal | last2=Nisan | first2=Noam |author-link2=Noam Nisan| title=Communication complexity | publisher=Cambridge University Press | location=Cambridge | year=2006 | isbn=978-0-521-02983-4 | oclc=70764786 }}
* Brassard, G. Quantum communication complexity: a survey. [https://arxiv.org/abs/quant-ph/0101005 https://arxiv.org/abs/quant-ph/0101005]
* Dietzfelbinger, M., J. Hromkovic, J., and G. Schnitger, "[https://www.sciencedirect.com/science/article/pii/S030439759600062X/pdf?md5=673842d5f5b8a83d07e2c183ffa357a1&pid=1-s2.0-S030439759600062X-main.pdf&_valck=1 A comparison of two lower-bound methods for communication complexity]", Theoret. Comput. Sci. 168, 1996. 39-51.
* [[Ran Raz|Raz, Ran]]. "Circuit and Communication Complexity." In Computational Complexity Theory. Steven Rudich and Avi Wigderson, eds. American Mathematical Society Institute for Advanced Study, 2004. 129-137.
* A. C. Yao, "Some Complexity Questions Related to Distributed Computing", Proc. of 11th STOC, pp.&nbsp;209–213, 1979. 14
* I. Newman, [http://u.cs.biu.ac.il/~zarosih/70/files/private_vs__common_random_bits_in_commun_493418.pdf Private vs. Common Random Bits in Communication Complexity], Information Processing Letters 39, 1991, pp.&nbsp;67–71.

{{DEFAULTSORT:Communication Complexity}}
[[Category:Information theory]]
[[Category:Computational complexity theory]]
[[Category:Quantum complexity theory]]