Noga Ron-Zewi

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 2012Show all

2 papers · 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…

cs.IT2012

A new upper bound on the query complexity for testing generalized Reed-Muller codes

Noga Ron-Zewi, Madhu Sudan

Over a finite field $\F_q$ the $(n, d, q)$ -Reed-Muller code is the code given by evaluations of $n$ -variate polynomials of total degree at most $d$ on all points (of $\F_q^n$). The t…