On Oracles and Algorithmic Methods for Proving Lower Bounds

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


Duration: 16:19
787 views
0

Authors: Nikhil Vyas, Ryan Williams (MIT)
ITCS - Innovations in Theoretical Computer Science



Other Videos By Simons Institute for the Theory of Computing


2023-01-19The Quest for Hardness of Metacomplexity: Progress, Barriers, and Next Steps (Part II)
2023-01-19The Quest for Hardness of Metacomplexity: Progress, Barriers, and Next Steps (Part I)
2023-01-19Probabilistic Kolmogorov Complexity
2023-01-18Kolmogorov Complexity for Meta-Complexity for Theoreticians
2023-01-18The Power of Distinguishing Simple From Random (Part II)
2023-01-18The Power of Distinguishing Simple From Random (Part I)
2023-01-18Intro to Meta-Complexity: Part 2
2023-01-17Intro to Meta-Complexity: Part 1
2023-01-15Constant-depth sorting networks
2023-01-12Black-box Constructive Proofs are Unavoidable
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


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