Lower Bounds for Symmetric Circuits for the Determinant

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


Duration: 42:57
107 views
0

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

Lower Bounds for Symmetric Circuits for the Determinant

Anuj Dawar (University of Cambridge)
Gregory Wilsenach (University of Cambridge)

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



Other Videos By Simons Institute for the Theory of Computing


2022-01-28Multiscale entropic regularization for MTS on general metric spaces
2022-01-28Beating the Folklore Algorithm for Dynamic Matching
2022-01-28Correlation-Intractable Hash Functions via Shift-Hiding
2022-01-28Domain Sparsification of Discrete Distributions using Entropic Independence
2022-01-28Average-case Hardness of NP and PH from Worst-case Fine-grained Assumptions
2022-01-28Dynamic Matching Algorithms Under Vertex Updates
2022-01-28Quantum Meets Fine-grained Complexity: Sublinear Time Quantum Algorithms for String Problems
2022-01-28Testing Distributions of Huge Objects
2022-01-28Mechanism Design with Moral Bidders
2022-01-28Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE
2022-01-28Lower Bounds for Symmetric Circuits for the Determinant
2022-01-28Monotone Complexity of Spanning Tree Polynomial Re-visited
2022-01-28Excluding PH Pessiland
2022-01-28Algebraic Restriction Codes and their Applications
2022-01-28Quantum Distributed Algorithms for Detection of Cliques
2022-01-28Probing to minimize
2022-01-28Fixed-Parameter Sensitivity Oracles
2022-01-28On the Existence of Competitive Equilibrium with Chores
2022-01-28Optimal Sub-Gaussian Mean Estimation in Very High Dimensions
2022-01-28Continuous Tasks and the Asynchronous Computability Theorem
2022-01-28A Complete Linear Programming Hierarchy for Linear Codes