15 citations · 47 across the 14 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2019★ 2 cited
Coin Theorems and the Fourier Expansion
Rohit Agrawal
In this note we compare two measures of the complexity of a class of Boolean functions studied in (unconditional) pseudorandomness: 's ability to distingui…
cs.CC2019
Samplers and Extractors for Unbounded Functions
Rohit Agrawal
Blasiok (SODA'18) recently introduced the notion of a subgaussian sampler, defined as an averaging sampler for approximating the mean of functions such…