The influence lower bound via query elimination

Details The influence lower bound via query elimination The influence lower bound via query elimination

2011-02-23

arxiv.org/abs/1102.4699v1

Computer Science

Computational Complexity

5 pages

Scientific paper

We give a simpler proof, via query elimination, of a result due to O'Donnell, Saks, Schramm and Servedio, which shows a lower bound on the zero-error randomized query complexity of a function f in terms of the maximum influence of any variable of f. Our lower bound also applies to the two-sided error distributional query complexity of f, and it allows an immediate extension which can be used to prove stronger lower bounds for some functions.

Affiliated with

Also associated with

No associations

Rating

The influence lower bound via query elimination does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The influence lower bound via query elimination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The influence lower bound via query elimination will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-174435