There are total Boolean functions with unbounded block sensitivity divided by sensitivity squared; in particular, a fixed exponent α>2 holds along a sequence with unbounded block sensitivity.
There are total Boolean functions with unbounded block sensitivity divided by sensitivity squared; in particular, a fixed exponent α>2 holds along a sequence with unbounded block sensitivity.
There are total Boolean functions with unbounded block sensitivity divided by sensitivity squared; in particular, a fixed exponent α>2 holds along a sequence with unbounded block sensitivity.
If correct, disproves the quadratic strengthening of the Sensitivity Conjecture for total Boolean functions.
Is block sensitivity universally bounded by a constant times sensitivity squared?
Publication dates and editorial changes.
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
