Separating the NP-Hardness of the Grothendieck problem from the Little-Grothendieck problem

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


Duration: 36:50
301 views
0

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

Separating the NP-Hardness of the Grothendieck problem from the Little-Grothendieck problem

Vijay Bhattiprolu (IAS/Princeton)
Euiwoong Lee (University of Michigan)
Madhur Tulsiani (Toyota Technological Institute Chicago)

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



Other Videos By Simons Institute for the Theory of Computing


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-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
2022-01-28Deterministic Dynamic Matching In Worst-Case Update Time
2022-01-28Larger Corner-Free Sets from Combinatorial Degenerations
2022-01-28Secret Sharing, Slice Formulas, and Monotone Real Circuits
2022-01-28Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems
2022-01-28Optimal Deterministic Clock Auctions and Beyond
2022-01-28Multiscale entropic regularization for MTS on general metric spaces