[3] He obtained his Ph.D. in mathematics from his dissertation titled Various Problems in Extremal Combinatorics from the University of California, Los Angeles (UCLA) in 2012 advised by Benny Sudakov.
[3] In July 2019, Huang announced a breakthrough, which gave a proof of the sensitivity conjecture.
[5] At that point the conjecture had been open for nearly 30 years, having been posed by Noam Nisan and Mario Szegedy in 1992.
[6] Huang has received positive attention for his discovery, as theoretical computer scientist Scott Aaronson described, "I find it hard to imagine that even God knows how to prove the Sensitivity Conjecture in any simpler way than this.
"[7] Huang received an NSF Career Award in 2019[8] and a Sloan Research Fellowship in 2020.