activity
20112026
most citedAn additive combinatorics approach to the log-rank conjecture in communication complexity

6 citations · 10 across the 10 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2012

Sampling-based proofs of almost-periodicity results and algorithmic applications

Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani +1

We give new combinatorial proofs of known almost-periodicity results for sumsets of sets with small doubling in the spirit of Croot and Sisask, whose almost-periodicity lemma has h…