Communication Complexity
E822918
Communication Complexity is a subfield of theoretical computer science that studies how much communication is required between parties to jointly compute a function of their distributed inputs.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Communication Complexity canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9810370 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Communication Complexity Context triple: [Theoretical Computer Science, hasSubfield, Communication Complexity]
-
A.
Communication
"Communication" is a popular trance track by Dutch DJ and producer Armin van Buuren, widely regarded as one of his early breakthrough releases.
-
B.
Communication
"Communication" is a 1983 synth-pop single by British band Spandau Ballet, known for its catchy melody and polished New Romantic style.
-
C.
Communication Problems
"Communication Problems" is a celebrated episode of the British sitcom *Fawlty Towers*, known for its farcical misunderstandings involving a hard-of-hearing guest and Basil Fawlty’s increasingly desperate attempts to hide his misdeeds.
-
D.
Intensified Dialogue
Intensified Dialogue is a formal NATO consultation and cooperation framework offered to interested partner countries as a step toward possible future membership.
-
E.
Views on individual communications
Views on individual communications are authoritative decisions issued by the UN Human Rights Committee on complaints brought by individuals alleging violations of the International Covenant on Civil and Political Rights.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Communication Complexity Target entity description: Communication Complexity is a subfield of theoretical computer science that studies how much communication is required between parties to jointly compute a function of their distributed inputs.
-
A.
Communication
"Communication" is a popular trance track by Dutch DJ and producer Armin van Buuren, widely regarded as one of his early breakthrough releases.
-
B.
Communication
"Communication" is a 1983 synth-pop single by British band Spandau Ballet, known for its catchy melody and polished New Romantic style.
-
C.
Communication Problems
"Communication Problems" is a celebrated episode of the British sitcom *Fawlty Towers*, known for its farcical misunderstandings involving a hard-of-hearing guest and Basil Fawlty’s increasingly desperate attempts to hide his misdeeds.
-
D.
Intensified Dialogue
Intensified Dialogue is a formal NATO consultation and cooperation framework offered to interested partner countries as a step toward possible future membership.
-
E.
Views on individual communications
Views on individual communications are authoritative decisions issued by the UN Human Rights Committee on complaints brought by individuals alleging violations of the International Covenant on Civil and Political Rights.
- F. None of above. chosen
Statements (66)
| Predicate | Object |
|---|---|
| instanceOf |
area of computational complexity theory
ⓘ
subfield of theoretical computer science ⓘ |
| analyzes | number of bits exchanged between parties ⓘ |
| appliesTo |
VLSI complexity
ⓘ
communication networks ⓘ data stream algorithms ⓘ distributed algorithms ⓘ parallel computing ⓘ |
| focusesOn | joint computation of a function of distributed inputs ⓘ |
| hasCanonicalText | Communication Complexity by Eyal Kushilevitz and Noam Nisan NERFINISHED ⓘ |
| hasKeyProblem |
disjointness lower bounds
ⓘ
equality problem ⓘ gap Hamming distance problem ⓘ greater-than problem ⓘ indexing problem ⓘ inner product problem ⓘ pointer chasing problem ⓘ set disjointness problem ⓘ |
| hasKeyResult |
Karchmer–Wigderson games
NERFINISHED
ⓘ
direct product theorems ⓘ direct sum theorems ⓘ log-rank conjecture NERFINISHED ⓘ lower bounds for disjointness ⓘ round elimination lemmas ⓘ |
| hasKeyTool |
corruption bound
ⓘ
discrepancy method ⓘ factorization norms ⓘ fooling set method ⓘ information-theoretic methods ⓘ partition bound ⓘ rank method ⓘ rectangle bounds ⓘ |
| hasResearcher |
Andrew Yao
NERFINISHED
ⓘ
Avi Wigderson NERFINISHED ⓘ Eyal Kushilevitz NERFINISHED ⓘ László Lovász NERFINISHED ⓘ Noam Nisan NERFINISHED ⓘ Ran Raz NERFINISHED ⓘ |
| includesModel |
multi-party communication model
ⓘ
number-in-hand model ⓘ number-on-forehead model ⓘ |
| provides |
lower bounds for circuit complexity
ⓘ
lower bounds for data structures ⓘ lower bounds for distributed computing ⓘ lower bounds for property testing ⓘ lower bounds for streaming algorithms ⓘ |
| relatedTo |
circuit complexity
ⓘ
coding theory ⓘ game theory ⓘ information theory ⓘ proof complexity ⓘ pseudorandomness ⓘ |
| studies |
amount of communication required to compute functions
ⓘ
communication required between distributed parties ⓘ |
| typicallyInvolves | two-party communication model ⓘ |
| usesConcept |
communication protocol
ⓘ
deterministic communication complexity ⓘ distributional complexity ⓘ information complexity ⓘ interactive communication protocols ⓘ nondeterministic communication complexity ⓘ one-way communication protocols ⓘ private-coin protocols ⓘ public-coin protocols ⓘ quantum communication complexity ⓘ randomized communication complexity ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Communication Complexity Description of subject: Communication Complexity is a subfield of theoretical computer science that studies how much communication is required between parties to jointly compute a function of their distributed inputs.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.