Videos from Workshops

Playlist: 20 videos

Lower Bounds in Computational Complexity Boot Camp

Workshop Talk Playlist

0:52:42

Circuit Lower Bounds from Algorithm Design: An Overview I

Ryan Williams, MIT
https://simons.berkeley.edu/talks/lower-bounds-algorithm-design-i
Lower Bounds in Computational Complexity Boot Camp
Visit talk page
1:5:12

Circuit Lower Bounds from Algorithm Design: An Overview II

Ryan Williams, MIT
https://simons.berkeley.edu/talks/clone-lower-bounds-algorithm-design-ii
Lower Bounds in Computational Complexity Boot Camp
Visit talk page
0:55:23

Restriction-based Methods I

Ben Rossman, University of Toronto
https://simons.berkeley.edu/talks/restriction-based-methods-i
Lower Bounds in Computational Complexity Boot Camp
Visit talk page
1:2:15

Restriction-based Methods II

Ben Rossman, University of Toronto
https://simons.berkeley.edu/talks/restriction-based-methods-ii
Lower Bounds in Computational Complexity Boot Camp
Visit talk page
1:2:25

Lower Bounds Techniques in Proof Complexity I

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
Visit talk page
1:2:22

Lower Bounds Techniques in Proof Complexity II

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
Visit talk page
0:57:2

Derandomization from Circuit Lower Bounds I

Russell Impagliazzo, UC San Diego
https://simons.berkeley.edu/talks/lower-bounds-and-derandomization-i
Lower Bounds in Computational Complexity Boot Camp
Visit talk page
0:58:14

Derandomization from Circuit Lower Bounds II

Russell Impagliazzo, UC San Diego
https://simons.berkeley.edu/talks/lower-bounds-and-derandomization-ii
Lower Bounds in Computational Complexity Boot Camp
Visit talk page
1:0:5

Geometric Complexity Theory: Complexity Lower Bounds Using Algebraic Geometry and Representation Theory I

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
Visit talk page
1:4:23

Geometric Complexity Theory: Complexity Lower Bounds Using Algebraic Geometry and Representation Theory II

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
Visit talk page