Sensitivity versus block sensitivity of Boolean functions
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/2s(f)(2) + 1/2s(f). The best known separation previously was bs(f) = 1/2s(f)(2) due to Rubinstein. We also report results of computer search for functions with at most 13 variables. (C) 2011 Elsevier BM. All rights reserved.
sensitivity block sensitivity computational complexity combinatorial problems