Is Untrusted Randomness Helpful?

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


Duration: 19:55
145 views
2

Authors: Uma Girish, Ran Raz, Wei Zhan (Princeton University)
ITCS - Innovations in Theoretical Computer Science



Other Videos By Simons Institute for the Theory of Computing


2023-01-04On Identity Testing and Noncommutative Rank Computation over the Free Skew Field
2023-01-04The Complexity of Infinite-Horizon General-Sum Stochastic Games
2023-01-04Online Pen Testing
2023-01-04What Can Cryptography Do For Decentralized Mechanism Design?
2023-01-04Consensus Division in an Arbitrary Ratio
2023-01-04Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes
2023-01-04List Agreement Expansion from Coboundary Expansion
2023-01-04Quantum Proofs of Deletion for Learning with Errors
2023-01-04Differentially Private Continual Releases of Streaming Frequency Moment Estimations
2023-01-04Counting Subgraphs in Somewhere Dense Graphs
2023-01-04Is Untrusted Randomness Helpful?
2023-01-04Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique
2023-01-04Making Auctions Robust to Aftermarkets
2023-01-04Asynchronous Multi-Party Quantum Computation
2023-01-04Decision Making under Miscalibration - 8 minute
2023-01-04Decision Making under Miscalibration
2023-01-04Epic Fail: Emulators can tolerate some edge faults for free
2023-01-04Karchmer-Wigderson Games for Hazard-free Computation
2023-01-04A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators
2023-01-04Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom
2023-01-04Rounding via Low Dimensional Embeddings


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
ITCS - Innovations in Theoretical Computer Science