Sciweavers

Share
2 search results - page 1 / 1
» Efficiently Testing Sparse GF(2) Polynomials
Sort
View
CORR
2008
Springer
84views Education» more  CORR 2008»
8 years 3 months ago
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 ...
Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, R...
ICALP
2009
Springer
9 years 3 months ago
Testing Fourier Dimensionality and Sparsity
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...
Parikshit Gopalan, Ryan O'Donnell, Rocco A. Served...
books