Fourier Sparsity and Dimension

Sanyal, S

Sanyal, S (reprint author), Indian Inst Technol, Dept Comp Sci & Engn, Kharagpur, W Bengal, India.

THEORY OF COMPUTING, 2019; 15 ():

Abstract

We prove that the Fourier dimension of any Boolean function with Fourier sparsity s is at most O (root s log s). This bound is tight up to a factor of......

Full Text Link