Testing fourier dimensionality and sparsity

Parikshit Gopalan*, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 property of a Boolean function having a concise Fourier representation is locally testable. We first give an efficient algorithm for testing whether the Fourier spectrum of a Boolean function is supported in a low-dimensional subspace of (equivalently, for testing whether f is a junta over a small number of parities). We next give an efficient algorithm for testing whether a Boolean function has a sparse Fourier spectrum (small number of nonzero coefficients). In both cases we also prove lower bounds showing that any testing algorithm - even an adaptive one - must have query complexity within a polynomial factor of our algorithms, which are nonadaptive. Finally, we give an "implicit learning" algorithm that lets us test any sub-property of Fourier concision. Our technical contributions include new structural results about sparse Boolean functions and new analysis of the pairwise independent hashing of Fourier coefficients from [12].

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings
Number of pages13
EditionPART 1
StatePublished - 2009
Externally publishedYes
Event36th International Colloquium on Automata, Languages and Programming, ICALP 2009 - Rhodes, Greece
Duration: 5 Jul 200912 Jul 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume5555 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference36th International Colloquium on Automata, Languages and Programming, ICALP 2009


Dive into the research topics of 'Testing fourier dimensionality and sparsity'. Together they form a unique fingerprint.

Cite this