On the average sensitivity of the weighted sum function

Authors:
Jiyou Li
Affiliations:
Department of Mathematics, Shanghai Jiao Tong University, Shanghai, PR China
Venue:
Information Processing Letters
Year:
2012

Citing 10
Cited 0

Sensitivity vs. block sensitivity (an average-case study)

Information Processing Letters
The average sensitivity of bounded-depth circuits

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

Theoretical Computer Science
Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables

Information Processing Letters
The average sensitivity of square-freeness

Computational Complexity
Complexity measures and decision tree complexity: a survey

Theoretical Computer Science - Complexity and logic
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
Quantum branching programs and space-bounded nonuniform quantum complexity

Theoretical Computer Science
Bounds on the Fourier coefficients of the weighted sum function

Information Processing Letters
Laced Boolean functions and subset sum problems in finite fields

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper we give a tight bound on the average sensitivity of the weighted sum function. This confirms a conjecture of Shparlinski. The weights of the weighted sum functions are also given and it shows that they are all asymptotically balanced.