Small Circuits Imply Efficient Arthur-Merlin Protocols

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


Duration: 33:33
345 views
0

13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
http://itcs-conf.org/

Small Circuits Imply Efficient Arthur-Merlin Protocols

Michael Ezra (Technion)
Ron Rothblum (Technion)

https://doi.org/10.4230/LIPIcs.ITCS.2022.67



Other Videos By Simons Institute for the Theory of Computing


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
2022-01-28Adaptive Massively Parallel Constant-round Tree Contraction
2022-01-28On Semi-Algebraic Proofs and Algorithms
2022-01-28Beating Classical Impossibility of Position Verification
2022-01-28A lower bound on the space overhead of fault-tolerant quantum computation