The sensitivity theorem, in computational complexity, was proved by Hao Huang in 2019 and states that the sensitivity of a Boolean function on n bits is always at least the square root of its degree, resolving a conjecture Noam Nisan and Mario Szegedy had posed in 1992. The proof, notable for its brevity after decades of limited progress on the problem, establishes that sensitivity, degree and decision tree complexity, several of the standard measures of how complicated a Boolean function is, are all polynomially related to one another. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Statement Form Connections
Has Statement Form
In Branch
Source Sensitivity theorem (Wikipedia)
Proved By
Source Sensitivity theorem (Wikipedia)
Sources
1. Sensitivity theorem (Wikipedia)
Lead section
In computational complexity, the sensitivity theorem, proved by Hao Huang in 2019, states that the sensitivity of a Boolean function f : { 0 , 1 } n → { 0 , 1 } {\displaystyle f:\{0,1\}^{n}\to \{0,1\}} is at least the square root of its degree, thus settling a conjecture posed by Nisan and Szegedy in 1992.
Proved By: Hao Huang, Lead sentence, attribution
proved by Hao Huang in 2019
View the Source2. Sensitivity theorem (Wikipedia)
Wikipedia Sensitivity theorem lead paragraph (w-bbfill-psymath4-0926)Quote, Wikipedia Sensitivity theorem lead paragraph (w-bbfill-psymath4-0926)
proved by Hao Huang in 2019
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.