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.
Innovations in Theoretical Computer Science , pages =
3 Pith papers cite this work, alongside 52 external citations. Polarity classification is still indexing.
3
Pith papers citing it
52
external citations · external index
years
2026 3representative citing papers
An exact formula is derived for the cardinality of the intersection of s q-ary Hamming balls of varying radii, plus refined center properties and large-n analysis for s=3.
Proves the stronger rational-degree conjecture holds with polynomial bounds for monotone, unate, bounded-alternation, symmetric, k-uniform hypergraph, and read-k DNF total Boolean functions.
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.
-
The Size of the Intersection of $q$-ary Hamming Balls
An exact formula is derived for the cardinality of the intersection of s q-ary Hamming balls of varying radii, plus refined center properties and large-n analysis for s=3.
-
On the Approximate Non-Deterministic Degree of Total Boolean Functions
Proves the stronger rational-degree conjecture holds with polynomial bounds for monotone, unate, bounded-alternation, symmetric, k-uniform hypergraph, and read-k DNF total Boolean functions.