The influence lower bound via query elimination
Computational Complexity
2011-02-24 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1102.4699,
title = {The influence lower bound via query elimination},
author = {Rahul Jain and Shengyu Zhang},
journal= {arXiv preprint arXiv:1102.4699},
year = {2011}
}
Comments
5 pages