ITCS 2022 Session 13
0Chair: Josh Alman
Polynomial Identity Testing via Evaluation of Rational Functions
Dieter van Melkebeek and Andrew Morgan (University of Wisconsin–Madison)
Lower Bounds for Symmetric Circuits for the Determinant
Anuj Dawar and Gregory Wilsenach (University of Cambridge)
Symbolic determinant identity testing and non-commutative ranks of matrix Lie algebras [paper]
Gábor Ivanyos (Institute for Computer Science and Control, Eötvös Loránd Research Network (ELKH), Budapest, Hungary); Tushant Mittal (University of Chicago); Youming Qiao (Center for Quantum Software and Information, University of Technology, Ultimo NSW 2007, Australia)
Efficient reconstruction of depth three arithmetic circuits with top fan-in two
Gaurav Sinha (Adobe Research India)
Monotone Complexity of Spanning Tree Polynomial Re-visited
Arkadev Chattopadhyay (TIFR); Rajit Datta (Goldman-Sachs); Utsab Ghosal (CMI); Partha Mukhopadhyay (Chennai Mathematical Institute)
13th Innovations in Theoretical Computer Science (ITCS) Conference
Other Videos By Simons Institute for the Theory of Computing
| 2022-02-04 | ITCS 2022 Session 23 |
| 2022-02-04 | ITCS 2022 Session 22 |
| 2022-02-04 | ITCS 2022 Session 21 |
| 2022-02-03 | ITCS 2022 Session 19 |
| 2022-02-03 | ITCS 2022 Session 20 |
| 2022-02-03 | ITCS 2022 Session 18 |
| 2022-02-03 | ITCS 2022 Session 17 |
| 2022-02-03 | ITCS 2022 Session 16 |
| 2022-02-02 | ITCS 2022 Session 15 |
| 2022-02-02 | ITCS 2022 Session 14 |
| 2022-02-02 | ITCS 2022 Session 13 |
| 2022-02-02 | ITCS 2022 Graduating Bits |
| 2022-02-02 | ITCS 2022 Session 12 |
| 2022-02-02 | ITCS 2022 Session 11 |
| 2022-02-02 | ITCS 2022 Session 10 |
| 2022-02-02 | ITCS 2022 Session 9 |
| 2022-02-02 | ITCS 2022 Session 8 |
| 2022-02-01 | ITCS 2022 Graduating Bits |
| 2022-02-01 | ITCS 2022 Session 7 |
| 2022-02-01 | Uniform brackets, containers, and combinatorial Macbeath regions |
| 2022-02-01 | FPT Algorithms for Finding Near-Cliques in $c$-Closed Graphs |