- Scott Aaronson, Open Problems in Mathematics, 2016, 1
- Pascal Koiran, “Arithmetic circuits: The chasm at depth four gets wider”, Theoretical Computer Science, 448, 2012, 56
- Dima Grigoriev, Edward A. Hirsch, “Algebraic proof systems over formulas”, Theoretical Computer Science, 303, № 1, 2003, 83
- Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi, “Approaching the Chasm at Depth Four”, J. ACM, 61, № 6, 2014, 1
- Edinah K. Gnang, Ahmed Elgammal, Vladimir Retakh, “A Spectral Theory for Tensors”, Annales de la Faculté des sciences de Toulouse : Mathématiques, 20, № 4, 2014, 801
- Steve Chien, Alistair Sinclair, “Algebras with Polynomial Identities and Computing the Determinant”, SIAM J. Comput., 37, № 1, 2007, 252
- Pranjal Dutta, Nitin Saxena, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 200
- Ran Raz, “Multi-linear formulas for permanent and determinant are of super-polynomial size”, J. ACM, 56, № 2, 2009, 1
- Noga Alon, Mrinal Kumar, Ben Lee Volk, “Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits”, Combinatorica, 40, № 2, 2020, 149
- Purnata Ghosal, B. V. Raghavendra Rao, 12730, Computer Science – Theory and Applications, 2021, 147