115 citations · 816 across the 62 of their papers we have counts for
Showing 2012 · cs.CCShow all
2 papers · 2 filters
cs.CC2012★ 1 cited
Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces
Anindya De, Ilias Diakonikolas, Vitaly Feldman +1
The \emph{Chow parameters} of a Boolean function are its degree-0 and degree-1 Fourier coefficients. It has been known since 1961 (Chow, Tannenba…
cs.CC2012★ 6 cited
Statistical Algorithms and a Lower Bound for Detecting Planted Clique
Vitaly Feldman, Elena Grigorescu, Lev Reyzin +2
We introduce a framework for proving lower bounds on computational problems over distributions against algorithms that can be implemented using access to a statistical query oracle…