R. Ryan Williams, “Natural Proofs versus Derandomization”, SIAM J. Comput., 45, no. 2, 2016, 497
Kazuyuki Amano, Akira Maruoka, “A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates”, SIAM J. Comput., 35, no. 1, 2005, 201
Ruiwen Chen, Valentine Kabanets, Jeff Kinne, “Lower Bounds Against Weakly-Uniform Threshold Circuits”, Algorithmica, 70, no. 1, 2014, 47
A.A. Razborov, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., 2004, 134
Leszek Aleksander Kołodziejczyk, “Independence results for variants of sharply bounded induction”, Annals of Pure and Applied Logic, 162, no. 12, 2011, 981
Avishay Tal, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017, 1256
Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet, “Separating Complexity Classes Using Autoreducibility”, SIAM J. Comput., 29, no. 5, 2000, 1497
Moritz Müller, Ján Pich, “Feasibly constructive proofs of succinct weak circuit lower bounds”, Annals of Pure and Applied Logic, 171, no. 2, 2020, 102735
Lijie Chen, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, 1281
Ilya Volkovich, 8572, Automata, Languages, and Programming, 2014, 1027