A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
The sensitivity conjecture of Nisan and Szegedy [CC'94] asks whether for any Boolean function f , the maximum sensitivity s(f ), is polynomially related to its block sensitivity bs(f ), and hence to other major complexity measures. Despite major advances in the analysis of Boolean functions over the last decade, the problem remains widely open. In this paper, we consider a restriction on the class of Boolean functions through a model of computation (DNF), and refer to the functions adhering todoi:10.4230/lipics.fsttcs.2016.15 dblp:conf/fsttcs/ST16 fatcat:6nxtzgtssvegnej7pcxqpc7mv4