Bounds on the Fourier coefficients of the weighted sum function

Authors:
Igor E. Shparlinski
Affiliations:
Department of Computing, Macquarie University, Sydney, NSW 2109, Australia
Venue:
Information Processing Letters
Year:
2007

Citing 12
Cited 2

Polynomial threshold functions, AC0 functions, and spectral norms

SIAM Journal on Computing
Constant depth circuits, Fourier transform, and learnability

Journal of the ACM (JACM)
On the degree of Boolean functions as real polynomials

Computational Complexity - Special issue on circuit complexity
The average sensitivity of bounded-depth circuits

Information Processing Letters
On the complexity of balanced Boolean functions

Information Processing Letters
A read-once lower bound and a (1, +k)-hierarchy for branching programs

Theoretical Computer Science
Quantum lower bounds by polynomials

Journal of the ACM (JACM)
Circuit and decision tree complexity of some number theoretic problems

Information and Computation
Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Highly nonlinear mappings

Journal of Complexity - Special issue on coding and cryptography
The influence of variables on Boolean functions

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
On the degree, nonlinearity, algebraic thickness, and nonnormality of Boolean functions, with developments on symmetric functions

IEEE Transactions on Information Theory

Laced Boolean functions and subset sum problems in finite fields

Discrete Applied Mathematics
On the average sensitivity of the weighted sum function

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

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.