Alasdair Urquhart, 3959, Theory and Applications of Models of Computation, 2006, 79
Samuel R. Buss, “Towards NP–P via proof complexity and search”, Annals of Pure and Applied Logic, 163, no. 7, 2012, 906
Dmitry Itsykson, Dmitry Sokolov, “Resolution over linear equations modulo two”, Annals of Pure and Applied Logic, 171, no. 1, 2020, 102722
Kazuhisa SETO, “An Introduction to Lower Bounds on Resolution Proof Systems”, IIS, 21, no. 4, 2015, 307
Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals, 10491, Theory and Applications of Satisfiability Testing – SAT 2017, 2017, 464
Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova, “Bounded-depth Frege complexity of Tseitin formulas for all graphs”, Annals of Pure and Applied Logic, 174, no. 1, 2023, 103166
Joshua Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal, “Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles”, SIAM J. Comput., 34, no. 2, 2005, 261
Albert Atserias, Víctor Dalmau, “A combinatorial characterization of resolution width”, Journal of Computer and System Sciences, 74, no. 3, 2008, 323
Alasdair Urquhart, “Width versus size in resolution proofs”, Theoretical Computer Science, 384, no. 1, 2007, 104
Nathan Segerlind, “The Complexity of Propositional Proofs”, Bull. symb. log., 13, no. 4, 2007, 417