Alex Samorodnitsky, Ilya Shkredov, Sergey Yekhanin, “Kolmogorov Width of Discrete Linear Spaces: an Approach to Matrix Rigidity”, comput. complex., 25, no. 2, 2016, 309
Mika Hirvensalo, 5257, Developments in Language Theory, 2008, 21
Emanuele Viola, “The communication complexity of addition”, Combinatorica, 35, no. 6, 2015, 703
Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman, 2014 IEEE 29th Conference on Computational Complexity (CCC), 2014, 262
Samuel R. Buss, “Towards NP–P via proof complexity and search”, Annals of Pure and Applied Logic, 163, no. 7, 2012, 906
Jan Pich, Rahul Santhanam, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, 1305
Vladimir V. Podolskii, “Exponential lower bound for bounded depth circuits with few threshold gates”, Information Processing Letters, 112, no. 7, 2012, 267
Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael Saks, “Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table”, SIAM J. Comput., 38, no. 1, 2008, 63
Ketan D. Mulmuley, Milind Sohoni, “Geometric Complexity Theory I: An Approach to thePvs.NPand Related Problems”, SIAM J. Comput., 31, no. 2, 2001, 496
Neeraj Kayal, Chandan Saha, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019, 413