Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity

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


Duration: 23:43
281 views
5

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

Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity

Shyan Akmal (MIT)
Lijie Chen (MIT)
Ce Jin (MIT)
Malvika Raj (UC Berkeley)
Ryan Williams (MIT)

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



Other Videos By Simons Institute for the Theory of Computing


2022-01-28A Complete Linear Programming Hierarchy for Linear Codes
2022-01-28On the download rate of homomorphic secret sharing
2022-01-28Indistinguishability Obfuscation of Null Quantum Circuits and Applications
2022-01-28Local Access to Random Walks
2022-01-28Errorless versus Error-prone Average-Case Complexity
2022-01-28Small Hazard-Free Transducers
2022-01-28Symbolic determinant identity testing and non-commutative ranks of matrix Lie algebras
2022-01-28Circuit lower bounds for low-energy states of quantum code Hamiltonians
2022-01-28A Unifying Framework for Characterizing and Computing Width Measures
2022-01-28Embeddings and labeling schemes for A*
2022-01-28Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity
2022-01-28Max-3-Lin over Non-Abelian Groups with Universal Factor Graphs
2022-01-28Time-Traveling Simulators Using Blockchains and Their Applications
2022-01-28An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few Passes
2022-01-28Pre-Constrained Encryption
2022-01-28Algorithms and Lower Bounds for Comparator Circuits from Shrinkage
2022-01-28Correlation detection in trees for planted graph alignment
2022-01-28Improved Decoding of Expander Codes
2022-01-28Interactive Proofs for Synthesizing Quantum States and Unitaries
2022-01-28PCPs and Instance Compression from a Cryptographic Lens
2022-01-28Nash-Bargaining-Based Models for Matching Markets: One-Sided and Two-Sided; Fisher and Arrow-Debreu