6533b854fe1ef96bd12ae16c

RESEARCH PRODUCT

Sensitivity versus block sensitivity of Boolean functions

Madars Virza

subject

FOS: Computer and information sciencesSequenceComputational complexity theoryBlock (permutation group theory)Computational Complexity (cs.CC)Computer Science ApplicationsTheoretical Computer ScienceCombinatoricsComputer Science - Computational ComplexitySignal ProcessingTheory of computationSensitivity (control systems)Boolean functionAlgorithmComputer searchInformation SystemsMathematics

description

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.

yearjournalcountryeditionlanguage
2010-08-03
http://arxiv.org/abs/1008.0521