Sensitivity versus block sensitivity of Boolean functions

Authors:
Madars Virza
Affiliations:
University of Latvia, Rainis bld. 19, Riga, LV-1586, Latvia
Venue:
Information Processing Letters
Year:
2011

Citing 4
Cited 1

CREW PRAMS and decision trees

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Complexity measures and decision tree complexity: a survey

Theoretical Computer Science - Complexity and logic
Sensitivity, block sensitivity, and l-block sensitivity of boolean functions

Information and Computation
Extending SAT Solvers to Cryptographic Problems

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing

Minterm-transitive functions with asymptotically smallest block sensitivity

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

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)=12s(f)^2+12s(f). The best known separation previously was bs(f)=12s(f)^2 due to Rubinstein. We also report results of computer search for functions with at most 13 variables.