{"version":"1.0","type":"link","title":"Sensitivity theorem - Newikis","description":"In computational complexity, the sensitivity theorem, proved by Hao Huang in 2019, states that the sensitivity of a Boolean function is at least the square root of its degree, thus settling a conjecture posed by Nisan and Szegedy in 1992. The proof is notably succinct, given that prior progress had…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}