This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
We give the first algorithm that is both query-efficient and time-efficient for testing whether an unknown function f : {0, 1}n {-1, 1} is an s-sparse GF(2) polynomial versus -far from every such polynomial. Our algorithm makes poly(s, 1/) black-box queries to f and runs in time n
Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, R