Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

DAGSTUHL
2006

favoriteEmaildiscussreport

129views Software Engineering» more DAGSTUHL 2006»

Bounds on the Fourier Coefficients of the Weighted Sum Function

13 years 5 months ago

Bounds on the Fourier Coefficients of the Weighted Sum Function

Download drops.dagstuhl.de

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.

Igor Shparlinski

Real-time Traffic

Boolean Function | DAGSTUHL 2006 | DAGSTUHL 2007 | Fourier Coefficients | Read-once Branching Programs |

claim paper

Related Content

» Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo Boolean Functi...

» On the nonlinearity of linear recurrence sequences

» Optimal query complexity bounds for finding graphs

» Exponential Sums as Discrete Fourier Transform with Invariant Phase Functions

» Nonequispaced Hyperbolic Cross Fast Fourier Transform

» On the fourier tails of bounded functions over the discrete cube

» Autocorrelation Coefficients and Correlation Immunity of Boolean Functions

» Testing Fourier Dimensionality and Sparsity

» Weights of Exact Threshold Functions

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	DAGSTUHL
Authors	Igor Shparlinski

Comments (0)