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.
Buriol and Gereon Frahling and Stefano Leonardi and Alberto Marchetti
1 Pith paper cite this work, alongside 265 external citations. Polarity classification is still indexing.
1
Pith paper citing it
265
external citations · external index
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.