ITCS 2022 Session 2

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


Duration: 1:07:45
297 views
0

Chair: Lijie Chen

On Hardness Assumptions Needed for ``Extreme High-End'' PRGs and Fast Derandomization Ronen Shaltiel (University of Haifa); Emanuele Viola (Northeastern University)
Errorless versus Error-prone Average-Case Complexity
Shuichi Hirahara (National Institute of Informatics); Rahul Santhanam (University of Oxford)
Reduction From Non-Unique Games to Boolean Unique Games
Ronen Eldan (Weizmann Institute); Dana Moshkowitz (University of Texas at Austin)
Pseudorandom Self-Reductions for NP-Complete Problems
Reyad Abed Elrazik (Technion); Robert Robere (McGill University); Assaf Schuster and Gal Yehuda (Technion)
Excluding PH Pessiland
Shuichi Hirahara (National Institute of Informatics); Rahul Santhanam (University of Oxford)

13th Innovations in Theoretical Computer Science (ITCS) Conference



Other Videos By Simons Institute for the Theory of Computing


2022-02-02ITCS 2022 Session 8
2022-02-01ITCS 2022 Graduating Bits
2022-02-01ITCS 2022 Session 7
2022-02-01Uniform brackets, containers, and combinatorial Macbeath regions
2022-02-01FPT Algorithms for Finding Near-Cliques in $c$-Closed Graphs
2022-02-01Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs
2022-02-01ITCS 2022 Session 6
2022-02-01ITCS 2022 Session 5
2022-02-01ITCS 2022 Session 4
2022-02-01ITCS 2022 Session 3
2022-01-31ITCS 2022 Session 2
2022-01-31ITCS 2022 Session 1
2022-01-31Randomness Extraction from Somewhat Dependent Sources
2022-01-31Noisy Boolean Hidden Matching with Applications
2022-01-31Small Circuits Imply Efficient Arthur-Merlin Protocols
2022-01-29Multi-Agent Reinforcement Learning (Part II)
2022-01-29Multi-Agent Reinforcement Learning (Part I)
2022-01-29Reinforcement Learning (Part II)
2022-01-28Reinforcement Learning (Part I)
2022-01-28Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descr
2022-01-28Separating the NP-Hardness of the Grothendieck problem from the Little-Grothendieck problem