Sensitivity Versus Block Sensitivity, II

Huang 2013 03 19 hi

Hao Huang
University of California, Los Angeles; Member, School of Mathematics
March 19, 2013

There are two important measures of the complexity of a boolean function: the sensitivity and block sensitivity. Whether or not they are polynomial related remains a major open question. In this talk I will survey some known results on this conjecture, and its connection with various combinatorial problems.