Pseudorandom Generators and Small-Space Derandomization

Pseudorandom Generators and Small-Space Derandomization

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


Duration: 10:01
305 views
4

William Hoza (Simons Institute)
Meet the Fellows Welcome Event



Other Videos By Simons Institute for the Theory of Computing


2021-09-14Planted Geometric Matching Problems
2021-09-13Sum Of Squares Lower Bounds Versus Low-Degree Polynomial Lower Bounds
2021-09-13Smoothed CSP Refutation Is As Easy As Random, For Both Efficient Algorithms And Certificates
2021-09-13On Implicit Regularization in Deep Learning
2021-09-13On the Power of Preconditioning in Sparse Linear Regression
2021-09-13Towards Credible and Effective Data-Driven Decision-Making
2021-09-13Primal--Dual Optimization and Application to Sampling
2021-09-13Data Efficient Methods for Reinforcement Learning
2021-09-13Theoretical Foundations of Data-Driven Algorithm Design
2021-09-13Distribution-Free Robustness
2021-09-13Pseudorandom Generators and Small-Space Derandomization
2021-09-13Preconditioning and Locality in Algorithm Design
2021-09-13Query, Communication and Discrepancy
2021-09-13Dynamic Linear Algebra
2021-09-13Let's Sample Perfectly
2021-09-13A Complexity-Theoretic Perspective on Fairness
2021-09-13Quantum Simulation of Relativistic Electronic Structure Hamiltonians
2021-09-13Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier
2021-09-13Quantum Necromancy and the Hardness of Observing Schrodinger's Cat
2021-09-13Short Proof of a Spectral Chernoff Bound for Local Hamiltonians
2021-09-13Fundamental Limits and Optimal Uses of Data in Modern Learning Problems


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Meet the Fellows Welcome Event
William Hoza