1 problem

In computational complexity, the sensitivity theorem, proved by Hao Huang in 2019, states that the sensitivity of a Boolean function $f\colon \{0,1\}^{n}\to \{0,1\}$ is at least th…