2 search results - page 1 / 1 » Efficiently Testing Sparse GF(2) Polynomials |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
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 ...
ICALP
2009
Springer
14 years 4 months ago
2009
Springer
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...