Talks
Chronological Order
Strong AverageCase Circuit Lower Bounds from Nontrivial Derandomization
Lijie Chen, Hanlin Ren
Combinatorics and TCS seminar, the University of Chicago
Lower Bounds in Computational Complexity Reunion, the Simons Institute for the Theory of Computing
[slides]
On The Power of Statistical Zero Knowledge
Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan
FOCS 2017
Algorithms & Complexity Seminar, MIT
[slides]
