N. R. Aravind, Pushkar S. Joglekar, 9210, Fundamentals of Computation Theory, 2015, 95
Zohar S. Karnin, Amir Shpilka, 2009 24th Annual IEEE Conference on Computational Complexity, 2009, 274
Richard J. Lipton, Kenneth W. Regan, Atri Rudra, 6907, Mathematical Foundations of Computer Science 2011, 2011, 436
Vince Grolmusz, “Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications”, SIAM J. Comput., 32, № 6, 2003, 1475
Mrinal Kumar, Ramprasad Saptharishi, “The Computational Power of Depth Five Arithmetic Circuits”, SIAM J. Comput., 48, № 1, 2019, 144
Amir Shpilka, “Affine projections of symmetric polynomials”, Journal of Computer and System Sciences, 65, № 4, 2002, 639
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi, 2013 IEEE Conference on Computational Complexity, 2013, 65
Toniann Pitassi, Iddo Tzameret, “Algebraic proof complexity”, ACM SIGLOG News, 3, № 3, 2016, 21
Ran Raz, “Tensor-Rank and Lower Bounds for Arithmetic Formulas”, J. ACM, 60, № 6, 2013, 1
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013, 578