| No. |
Title |
Author |
Year |
| 1 |
A Largish Sum-Of-Squares Implies Circuit Hardness and Derandomization |
Dutta, Pranjal et al. |
2021 |
| 2 |
Algebraic Methods in Quantum and Classical Models of Computation (Dagstuhl Seminar 02421) |
Buhrman, Harry et al. |
2021 |
| 3 |
Factorization of Polynomials Given By Arithmetic Branching Programs |
Sinhababu, Amit et al. |
2020 |
| 4 |
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces |
Gurjar, Rohit et al. |
2018 |
| 5 |
Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411) |
Kabanets, Valentine et al. |
2017 |
| 6 |
Algebra in Computational Complexity (Dagstuhl Seminar 14391) |
Agrawal, Manindra et al. |
2015 |
| 7 |
Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs |
Gurjar, Rohit et al. |
2015 |
| 8 |
Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421) |
Agrawal, Manindra et al. |
2013 |
| 9 |
09421 Abstracts Collection -- Algebraic Methods in Computational Complexity |
Agrawal, Manindra et al. |
2010 |
| 10 |
09421 Executive Summary -- Algebraic Methods in Computational Complexity |
Agrawal, Manindra et al. |
2010 |
| 11 |
Planar Graph Isomorphism is in Log-Space |
Datta, Samir et al. |
2010 |
| 12 |
Graph Isomorphism for K_{3,3}-free and K_5-free graphs is in Log-space |
Datta, Samir et al. |
2009 |
| 13 |
07411 Abstracts Collection -- Algebraic Methods in Computational Complexity |
Agrawal, Manindra et al. |
2008 |
| 14 |
07411 Executive Summary -- Algebraic Methods in Computational Complexity |
Agrawal, Manindra et al. |
2008 |
| 15 |
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace |
Thierauf, Thomas et al. |
2008 |
| 16 |
04421 Abstracts Collection -- Algebraic Methods in Computational Complexity |
Buhrman, Harry et al. |
2005 |
