On the Resolution of the Sensitivity Conjecture

12/11/2019

∙

by   Rohan Karthikeyan, et al.

∙

0

∙

share

The Sensitivity Conjecture is a long-standing problem in theoretical computer science that seeks to fit the sensitivity of a Boolean function into a unified framework formed by the other complexity measures of Boolean functions, such as block sensitivity and certificate complexity. After more than thirty years of attacks on this Conjecture, it was finally proved in early July 2019 by Prof. Hao Huang. In this survey, we explore the ideas that inspired the proof of this Conjecture by an exposition of four papers that had the most impact on the Conjecture (including Hao's result).