Worst-Case to Expander-Case Reductions

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


Duration: 22:41
457 views
8

Authors:amir Abboud, Nathan Wallheimer (Weizmann Institute)
ITCS - Innovations in Theoretical Computer Science



Other Videos By Simons Institute for the Theory of Computing


2023-01-11On Oracles and Algorithmic Methods for Proving Lower Bounds
2023-01-09On disperser/lifting properties of the Index and Inner-Product functions
2023-01-09Bit Complexity of Jordan Normal Form and Spectral Factorization
2023-01-08Certification with an NP Oracle
2023-01-08Matrix multiplication via matrix groups
2023-01-06TFNP Characterizations of Proof Systems and Monotone Circuits
2023-01-06Resilience of 3-Majority Dynamics to Non-Uniform Schedulers
2023-01-05Exponential separations using guarded extension variables
2023-01-05Beyond Worst-Case Budget-Feasible Mechanism Design
2023-01-05HappyMap: A Generalized Multicalibration Method
2023-01-05Worst-Case to Expander-Case Reductions
2023-01-04Proofs of Quantumness from Trapdoor Permutations
2023-01-04On computing homological hitting sets
2023-01-04A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems
2023-01-04Generalized Private Selection and Testing with High Confidence
2023-01-04All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method
2023-01-04Is it easier to count communities than find them?
2023-01-04Secure Distributed Network Optimization Against Eavesdroppers
2023-01-04Algorithms with More Granular Differential Privacy Guarantees
2023-01-04Graph Searching with Predictions
2023-01-04False Consensus, Information Theory, and Prediction Markets


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