Computing GapMAJ∘fⁿ requires n·(I−O(1)) bits of information, making GapMAJ the third outer gadget with a strong composition theorem in two-player communication.
A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication Complexity , booktitle =
1 Pith paper cite this work, alongside 32 external citations. Polarity classification is still indexing.
1
Pith paper citing it
32
external citations · OpenAlex
fields
cs.CC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Gap-Majority Lemmas in Communication Complexity
Computing GapMAJ∘fⁿ requires n·(I−O(1)) bits of information, making GapMAJ the third outer gadget with a strong composition theorem in two-player communication.