Sensitivity versus block sensitivity of Boolean functions
Computational Complexity
2010-12-09 v2
Abstract
Determining the maximal separation between sensitivity and block sensitivity of Boolean functions is of interest for computational complexity theory. We construct a sequence of Boolean functions with bs(f) = 1/2 s(f)^2 + 1/2 s(f). The best known separation previously was bs(f) = 1/2 s(f)^2 due to Rubinstein. We also report results of computer search for functions with at most 12 variables.
Keywords
Cite
@article{arxiv.1008.0521,
title = {Sensitivity versus block sensitivity of Boolean functions},
author = {Madars Virza},
journal= {arXiv preprint arXiv:1008.0521},
year = {2010}
}
Comments
5 pages, no figures