Eric Allender, Shuichi Hirahara, “New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems”, ACM Trans. Comput. Theory, 11, № 4, 2019, 1
Rahul Ilango, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 427
Amir Shpilka, “Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates”, SIAM J. Comput., 38, № 6, 2009, 2130
Iftach Haitner, Omer Reingold, Salil Vadhan, Proceedings of the forty-second ACM symposium on Theory of computing, 2010, 437
Eric Allender, 12038, Language and Automata Theory and Applications, 2020, 3
Valentine Kabanets, “Easiness Assumptions and Hardness Tests: Trading Time for Zero Error”, Journal of Computer and System Sciences, 63, № 2, 2001, 236
Akinori KAWACHI, “Proving Circuit Lower Bounds in High Uniform Classes”, IIS, 20, № 1, 2014, 1
Akinori Kawachi, “Circuit lower bounds from learning-theoretic approaches”, Theoretical Computer Science, 733, 2018, 83
Eric Allender, Rahul Ilango, Neekon Vafa, “The Non-hardness of Approximating Circuit Size”, Theory Comput Syst, 65, № 3, 2021, 559
Lance Fortnow, Rahul Santhanam, 6755, Automata, Languages and Programming, 2011, 569