Algebraic and circuit complexity

Algebraic and circuit complexity

Published on ● Video Link: https://www.youtube.com/watch?v=KZifvHDRK5E



Duration: 1:10:43
301 views
2


Complexity measures on symmetric group and beyond
Neta Dafni (Technion), Yuval Filmus (Technion), Noam Lifshitz (Hebrew University), Nathan Lindzey (CU Boulder), Marc Vinyals (Technion)

On the Complexity of #CSP^d
Jiabao Lin (Shanghai University of Finance and Economics)

On the complexity of isomorphism problems for tensors, groups, and polynomials I: Tensor Isomorphism-completeness
Joshua A. Grochow (University of Colorado, Boulder), Youming Qiao (University of Technology Sydney)

A Polynomial Degree Bound on Equations for Non-rigid Matrices and Small Linear Circuits
Mrinal Kumar (IIT Bombay), Ben Lee Volk (Caltech/UT Austin)

A Largish Sum-of-Squares Implies Circuit Hardness and Derandomization
Pranjal Dutta (Chennai Mathematical Institute), Nitin Saxena (IIT Kanpur), Thomas Thierauf (Aalen University)

ITCS 2021







Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
ITCS 2021