Communication Complexity - Applications

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.

Read more about this topic:  Communication Complexity