28 lines
1.9 KiB
Markdown
28 lines
1.9 KiB
Markdown
---
|
||
title: "Communication complexity"
|
||
chunk: 8/8
|
||
source: "https://en.wikipedia.org/wiki/Communication_complexity"
|
||
category: "reference"
|
||
tags: "science, encyclopedia"
|
||
date_saved: "2026-05-05T14:40:16.151030+00:00"
|
||
instance: "kb-cron"
|
||
---
|
||
|
||
== Applications ==
|
||
Lower bounds in communication complexity can be used to prove lower bounds in decision tree complexity, VLSI circuits, data structures, streaming algorithms, space–time tradeoffs for Turing machines and more.
|
||
Conitzer and Sandholm studied the communication complexity of some common voting rules, which are essential in political and non political organizations. Compilation complexity is a closely related notion, which can be seen as a single-round communication complexity.
|
||
Nayebi has studied the communication complexity of unbounded and bounded Bayesians, establishing no-free-lunch theorems (lower bounds) on AI alignment.
|
||
|
||
== See also ==
|
||
Gap-Hamming problem
|
||
|
||
== Notes ==
|
||
|
||
== References ==
|
||
Rao, Anup; Yehudayoff, Amir (2020). Communication complexity and applications. Cambridge: Cambridge University Press. ISBN 9781108671644.
|
||
Kushilevitz, Eyal; Nisan, Noam (2006). Communication complexity. Cambridge: Cambridge University Press. ISBN 978-0-521-02983-4. OCLC 70764786.
|
||
Brassard, G. Quantum communication complexity: a survey. https://arxiv.org/abs/quant-ph/0101005
|
||
Dietzfelbinger, M., J. Hromkovic, J., and G. Schnitger, "A comparison of two lower-bound methods for communication complexity", Theoret. Comput. Sci. 168, 1996. 39–51.
|
||
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. 209–213, 1979. 14
|
||
I. Newman, Private vs. Common Random Bits in Communication Complexity, Information Processing Letters 39, 1991, pp. 67–71. |