Sensitivity Versus Block Sensitivity, I
Series:
Computer Science/Discrete Mathematics
Hao Huang
University of California, Los Angeles; Member, School of Mathematics
Date & Time:
Tue, 03/12/2013 - 10:30 - 12:30
Location:
S-101
Video Link:
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.
45400
Dorothea Phares
phares@ias.edu
Wed, 12/19/2012 - 18:21
Wed, 02/27/2013 - 18:25