Research any topic before you write.
Find related topics. | Discover entities. | See connections. | Build a topical map.
In theoretical computer science, communication complexity studies the amount of communication required to solve a problem when the input to the problem is distributed among two or more parties. The study of communication complexity was first introduced by Andrew Yao in 1979, while studying the problem of computation distributed among several machines.…
Applications, Art & Science
Explore the main themes, entities and connections around Communication complexity. Start with the topic map, then use the sections below for research and deeper semantic analysis.
Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.
High-confidence facts extracted from structured source data. Use them as anchors for further research.
Browse the full topic structure. Each item opens a new analysis centered on that subject.
Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.
See the strongest relationship patterns around the current topic before diving into the raw triples.
Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.
displaystyle communication complexity alice bob protocol function bits random matrix string randomized lower parties problem information bit bound number one
| Subject | Predicate | Object | Confidence | Src |
|---|---|---|---|---|
| Communication complexity | is a | binary logarithm of the rectangle covering number of the matrix | 0.90 | text |
| Communication complexity | has application | Lower | 0.60 | section |
| Communication complexity | has application | VLSI | 0.60 | section |
| Communication complexity | has application | Turing | 0.60 | section |
| Communication complexity | has application | Conitzer | 0.60 | section |
| Communication complexity | has application | Sandholm | 0.60 | section |
| Communication complexity | has application | Compilation | 0.60 | section |
| Communication complexity | related to Collapse of randomized communication complexity | Let's | 0.60 | section |
| Communication complexity | related to Collapse of randomized communication complexity | Alice | 0.60 | section |
| Communication complexity | related to Collapse of randomized communication complexity | Bob | 0.60 | section |
| Communication complexity | related to Collapse of randomized communication complexity | Using | 0.60 | section |
| Communication complexity | related to Collapse of randomized communication complexity | Definition | 0.60 | section |
These clusters group vocabulary that occurs around closely connected concepts in the source material.
Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.