Bounds on the Fourier Coefficients of the Weighted Sum Function

We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an asymptotically "flat" Fourier spectrum and thus implies several lower bounds of its various complexity measures.

• Type: Conference
• Year: 2006
• Where: DAGSTUHL
• Authors: Igor Shparlinski
• Keywords: Boolean Function, DAGSTUHL 2006, DAGSTUHL 2007, Fourier Coefficients, Read-once Branching Programs