New separation between $s(f)$ and $bs(f)$
Computational Complexity
2011-08-18 v1
Abstract
In this note we give a new separation between sensitivity and block sensitivity of Boolean functions: bs(f)=(2/3)s(f)2−(1/3)s(f).
Cite
@article{arxiv.1108.3494,
title = {New separation between $s(f)$ and $bs(f)$},
author = {Andris Ambainis and Xiaoming Sun},
journal= {arXiv preprint arXiv:1108.3494},
year = {2011}
}
Comments
7 pages
Related papers
View all related →
Computational Complexity · Computer Science
Sensitivity versus block sensitivity of Boolean functions
Madars Virza
2010-12-09
Computational Complexity · Computer Science
On Block Sensitivity and Fractional Block Sensitivity
Andris Ambainis, Krišjānis Prūsis, Jevgēnijs Vihrovs
2018-10-08
Computational Complexity · Computer Science
Sensitivity versus Certificate Complexity of Boolean Functions
Andris Ambainis, Krišjānis Prūsis, Jevgēnijs Vihrovs
2015-06-09
Computational Complexity · Computer Science
New upper bound on block sensitivity and certificate complexity in terms of sensitivity
Andris Ambainis, Yihan Gao, Jieming Mao, Xiaoming Sun +1
2013-06-25
Computational Complexity · Computer Science
On Separation between the Degree of a Boolean Function and the Block Sensitivity
Nikolay V. Proskurin
2021-06-22
Computational Complexity · Computer Science
On the Sensitivity Conjecture for Disjunctive Normal Forms
Karthik C. S., Sébastien Tavenas
2016-12-08
Computational Complexity · Computer Science
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity
Andris Ambainis, Krišjānis Prūsis
2015-03-27
Computational Complexity · Computer Science
Composition limits and separating examples for some Boolean function complexity measures
Justin Gilmer, Michael Saks, Srikanth Srinivasan
2013-06-05
Computational Complexity · Computer Science
Block Sensitivity of Minterm-Transitive Functions
Andrew Drucker
2010-01-14
Computational Complexity · Computer Science
Several Separations Based on a Partial Boolean Function
Kaspars Balodis
2021-03-10
Computational Complexity · Computer Science
A Tighter Relation between Sensitivity and Certificate Complexity
Kun He, Qian Li, Xiaoming Sun
2016-09-15
Computational Complexity · Computer Science
Degree and Sensitivity: tails of two distributions
Parikshit Gopalan, Rocco Servedio, Avishay Tal, Avi Wigderson
2016-04-27
Computational Complexity · Computer Science
Low-Sensitivity Functions from Unambiguous Certificates
Shalev Ben-David, Pooya Hatami, Avishay Tal
2017-11-17
Computational Complexity · Computer Science
On the distribution of sensitivities of symmetric Boolean functions
Jon T. Butler, Tsutomu Sasao, Shinobu Nagayama
2023-06-27
Computational Complexity · Computer Science
Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps
Krishnamoorthy Dinesh, Jayalal Sarma
2019-02-12
Discrete Mathematics · Computer Science
Sensitivity and block sensitivity of nested canalyzing function
Yuan Li, John O. Adeyeye
2012-09-10
Combinatorics · Mathematics
Lattice Variant of the Sensitivity Conjecture
Meena Boppana
2012-07-10
Computational Complexity · Computer Science
Tighter Relations Between Sensitivity and Other Complexity Measures
Andris Ambainis, Mohammad Bavarian, Yihan Gao, Jieming Mao +2
2014-11-14
Computational Complexity · Computer Science
Sensitivity, Affine Transforms and Quantum Communication Complexity
Krishnamoorthy Dinesh, Jayalal Sarma
2020-09-15
Computational Complexity · Computer Science
Separation Results for Boolean Function Classes
Aniruddha Biswas, Palash Sarkar
2020-10-23
Probability · Mathematics
A study of distributional complexity measures for Boolean functions
Laurin Köhler-Schindler, Jeffrey E. Steif
2024-08-26
Information Theory · Computer Science
Boolean Functions with Biased Inputs: Approximation and Noise Sensitivity
Mohsen Heidari, S. Sandeep Pradhan, Ramji Venkataramanan
2019-07-09
Computational Complexity · Computer Science
Bounding the Sensitivity of Polynomial Threshold Functions
Prahladh Harsha, Adam Klivans, Raghu Meka
2014-03-28
Computational Complexity · Computer Science
Algorithms for Boolean Function Query Properties
Scott Aaronson
2007-05-23
Computational Complexity · Computer Science
Boolean Functions with Minimal Spectral Sensitivity
Krišjānis Prūsis, Jevgēnijs Vihrovs
2025-02-21