2 research outputs found
New upper bound on block sensitivity and certificate complexity in terms of sensitivity
Sensitivity \cite{CD82,CDR86} and block sensitivity \cite{Nisan91} are two
important complexity measures of Boolean functions. A longstanding open problem
in decision tree complexity, the "Sensitivity versus Block Sensitivity"
question, proposed by Nisan and Szegedy \cite{Nisan94} in 1992, is whether
these two complexity measures are polynomially related, i.e., whether
.
We prove an new upper bound on block sensitivity in terms of sensitivity:
. Previously, the best upper bound on block
sensitivity was by
Kenyon and Kutin \cite{KK}. We also prove that if is a
constant, then sensitivity and block sensitivity are linearly related, i.e.
.Comment: 9 page
Sensitivity versus Certificate Complexity of Boolean Functions
Sensitivity, block sensitivity and certificate complexity are basic
complexity measures of Boolean functions. The famous sensitivity conjecture
claims that sensitivity is polynomially related to block sensitivity. However,
it has been notoriously hard to obtain even exponential bounds. Since block
sensitivity is known to be polynomially related to certificate complexity, an
equivalent of proving this conjecture would be showing that certificate
complexity is polynomially related to sensitivity. Previously, it has been
shown that . In this work, we
give a better upper bound of using a recent
theorem limiting the structure of function graphs. We also examine relations
between these measures for functions with small 1-sensitivity and
arbitrary 0-sensitivity