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=L7SbTgtAsNY


Duration: 13:45
568 views
9

William Hoza (Simons Institute)
https://simons.berkeley.edu/talks/pseudorandom-generators-and-small-space-derandomization
Meet the Fellows Welcome Event Fall 2022

Compared to other big open questions in complexity theory, there is a lot of optimism about proving L = BPL in our lifetimes. Over the past few decades, there has been steady progress on the problem from several different angles. Arguably the most promising approach is to design sufficiently powerful pseudorandom generators (PRGs). PRGs have applications beyond derandomization, and they provide deep insights into the powers and limitations of the models of computation that they fool. In this talk, I will give a brief overview of these topics and my research in the area.



Other Videos By Simons Institute for the Theory of Computing


2022-09-13Causal Inference in Complex Systems: Network Interference, Strategic Agents, and Beyond
2022-09-13Inference and Interference in Marketplace Experimentation
2022-09-13Causal Matrix Completion: Applications to Offline Causal Reinforcement Learning
2022-09-13Greedy Approximation Algorithms for Active Sequential Hypothesis Testing
2022-09-13Expert Advice in Complex Environments
2022-09-12Retrospective Search: Exploration and Ambition on Uncharted Terrain
2022-09-12Dynamically Aggregating Diverse Information
2022-09-10Simplicity and Optimality in Algorithmic Economics
2022-09-10Algorithms Using Local Graph Features to Predict Epidemics
2022-09-10Beyond Worst Case Analysis in ML
2022-09-09Pseudorandom Generators and Small-Space Derandomization
2022-09-09Competitive Control
2022-09-09Machine Learning on Large-Scale Graphs
2022-09-09Adaptive Online Learning without Prior Knowledge
2022-09-09Incentive-Aware Machine Learning
2022-09-09How Robust Is the Gittins Index? A Queueing Case Study
2022-09-09Quantum Scientific Computation
2022-09-09Quantum Algorithms for Hamiltonian Simulation with Unbounded Operators
2022-09-09Recent Trends in Minimum Cut Algorithms
2022-09-09The Power of Two Matrices in Spectral Algorithms
2022-09-09Approximately Efficient Bilateral Trade


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