Efficiently Testing Sparse GF(2) Polynomials

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

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan
• Keywords: Algorithm, CORR 2008, Education, Polynomials, Unknown Function