Joshua A. Grochow, “Unifying Known Lower Bounds via Geometric Complexity Theory”, comput. complex., 24, no. 2, 2015, 393
Neeraj Kayal, Chandan Saha, “Lower Bounds for Depth-Three Arithmetic Circuits with small bottom fanin”, comput. complex., 25, no. 2, 2016, 419
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi, “Arithmetic Circuits: A Chasm at Depth 3”, SIAM J. Comput., 45, no. 3, 2016, 1064
Maurice J. Jansen, Kenneth W. Regan, 4598, Computing and Combinatorics, 2007, 470
Ran Raz, Amir Yehudayoff, 2008 23rd Annual IEEE Conference on Computational Complexity, 2008, 128
Markus Bläser, David Eisenbud, Frank-Olaf Schreyer, “Ulrich complexity”, Differential Geometry and its Applications, 55, 2017, 128
Nitin Saxena, 5125, Automata, Languages and Programming, 2008, 60
Eric Allender, V. Arvind, Rahul Santhanam, Fengming Wang, “Uniform derandomization from pathetic lower bounds”, Phil. Trans. R. Soc. A., 370, no. 1971, 2012, 3512
Zeev Dvir, Amir Shpilka, Amir Yehudayoff, “Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits”, SIAM J. Comput., 39, no. 4, 2010, 1279
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi, “Unexpected power of low-depth arithmetic circuits”, Commun. ACM, 60, no. 6, 2017, 93