Russell Impagliazzo, Nathan Segerlind, 2380, Automata, Languages and Programming, 2002, 208
Ran Raz, “Resolution lower bounds for the weak pigeonhole principle”, J. ACM, 51, no. 2, 2004, 115
M. Alekhnovich, E. Ben-Sasson, A.A. Razborov, A. Wigderson, Proceedings 41st Annual Symposium on Foundations of Computer Science, 2000, 43
Yuval Filmus, Massimo Lauria, Mladen Mikša, Jakob Nordström, Marc Vinyals, 7965, Automata, Languages, and Programming, 2013, 437
Ilario Bonacina, Nicola Galesi, “A Framework for Space Complexity in Algebraic Proof Systems”, J. ACM, 62, no. 3, 2015, 1
Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin, “Computational and Proof Complexity of Partial String Avoidability”, ACM Trans. Comput. Theory, 13, no. 1, 2021, 1
Olaf Beyersdorff, 6108, Theory and Applications of Models of Computation, 2010, 15
Jan Krajíček, Proof Complexity, 2019
Nathan Segerlind, “The Complexity of Propositional Proofs”, Bull. symb. log., 13, no. 4, 2007, 417
Nicola Galesi, Massimo Lauria, “On the Automatizability of Polynomial Calculus”, Theory Comput Syst, 47, no. 2, 2010, 491