Derandomization from Circuit Lower Bounds I

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=mVJzcyswfOY


Duration: 57:02
535 views
6

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



Other Videos By Simons Institute for the Theory of Computing


2018-08-24Time-Space Lower Bounds for Learning I
2018-08-23Lower Bounds for Dynamic Data Structures II
2018-08-23Lower Bounds for Dynamic Data Structures I
2018-08-23Communication Complexity II
2018-08-23Communication Complexity I
2018-08-22Lower Bounds in Arithmetic Circuit Complexity II
2018-08-22Lower Bounds in Arithmetic Circuit Complexity I
2018-08-22Geometric Complexity Theory II: Complexity Lower Bounds...
2018-08-22Geometric Complexity Theory I: Complexity Lower Bounds...
2018-08-21Derandomization from Circuit Lower Bounds II
2018-08-21Derandomization from Circuit Lower Bounds I
2018-08-21Lower Bounds Techniques in Proof Complexity II
2018-08-21Lower Bounds Techniques in Proof Complexity I
2018-08-20Restriction-based Methods II
2018-08-20Restriction-based Methods I
2018-08-20Circuit Lower Bounds from Algorithm Design: An Overview II
2018-08-20Circuit Lower Bounds from Algorithm Design: An Overview I (Partial)
2018-07-25TUTORIAL: Recent Development in Selective Inference II
2018-07-25TUTORIAL: Recent Development in Selective Inference I
2018-07-24TUTORIAL: Recent Development in Differential Privacy II
2018-07-24TUTORIAL: Recent Development in Differential Privacy I


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Lower Bounds in Computational Complexity Boot Camp
Russell Impagliazzo