Talk page

Title:
Sensitivity Versus Block Sensitivity, II

Speaker:
Hao Huang

Abstract:
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.

Link:
https://www.ias.edu/video/csdm/1213/0319-HaoHuang