- Some Surveys on Algebraic Complexity Theory
- [Sap15] A selection of lowerbounds in arithmetic circuit complexity
- [SY10] Arithmetic Circuits: a survry of recent results and open questions
- [CKW11] Partial Derivatives in Arithmetic Complexity and Beyond
- [KS19] Hardness-Randomness Tradeoffs for Algebraic Computation
- [AS09] Classifying polynomials and identity testing
- [Sax09] Progress on Polynomial Identity Testing
- [Sax14] Progress on Polynomial Identity Testing – II
- [Arv14] Noncommutative Arithmetic Circuits meet Finite Automata

- Workshop on Algebraic Complexity Theory

- Others