Pith. sign in

54th Annual

Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff , title = · 2013 · DOI 10.1109/focs.2013.85

1 Pith paper cite this work, alongside 75 external citations. Polarity classification is still indexing.

1 Pith paper citing it
75 external citations · OpenAlex
open at publisher browse 1 citing papers

fields

cs.CC 1

years

2026 1

verdicts

CONDITIONAL 1

representative citing papers

Gap-Majority Lemmas in Communication Complexity

cs.CC · 2026-07-08 · conditional · novelty 7.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Gap-Majority Lemmas in Communication Complexity cs.CC · 2026-07-08 · conditional · none · ref 9

    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.