Bounds on the Fourier coefficients of the weighted sum function

Igor E. Shparlinski*

*Corresponding author for this work

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

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 rather "flat" Fourier spectrum and thus implies several lower bounds on some of its complexity measures.

Original languageEnglish
Pages (from-to)83-87
Number of pages5
JournalInformation Processing Letters
Volume103
Issue number3
DOIs
Publication statusPublished - 31 Jul 2007

Fingerprint Dive into the research topics of 'Bounds on the Fourier coefficients of the weighted sum function'. Together they form a unique fingerprint.

Cite this