Pavel Hrubes, Academy of Sciences of the Czech Republic
https://simons.berkeley.edu/talks/lower-bounds-techniques-proof-complexity
Lower Bounds in Computational Complexity Boot Camp
Pavel Hrubes, Academy of Sciences of the Czech Republic
https://simons.berkeley.edu/talks/lower-bounds-techniques-proof-complexity-ii
Lower Bounds in Computational Complexity Boot Camp
Russell Impagliazzo, UC San Diego
https://simons.berkeley.edu/talks/lower-bounds-and-derandomization-i
Lower Bounds in Computational Complexity Boot Camp
Russell Impagliazzo, UC San Diego
https://simons.berkeley.edu/talks/lower-bounds-and-derandomization-ii
Lower Bounds in Computational Complexity Boot Camp
Christian Ikenmeyer, Max Planck Institute for Informatics
https://simons.berkeley.edu/talks/gct-lower-bounds-using-algebraic-geometry-and-representation-theory-i
Lower Bounds in Computational Complexity Boot Camp
Christian Ikenmeyer, Max Planck Institute for Informatics
https://simons.berkeley.edu/talks/gct-lower-bounds-using-algebraic-geometry-and-representation-theory-ii
Lower Bounds in Computational Complexity Boot Camp