Alexander A Razborov, “Resolution lower bounds for perfect matching principles”, Journal of Computer and System Sciences, 69, no. 1, 2004, 3
Dmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov, 9139, Computer Science – Theory and Applications, 2015, 219
Chris Beck, Jakob Nordstrom, Bangsheng Tang, Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, 2013, 813
Moritz Müller, Stefan Szeider, “The treewidth of proofs”, Information and Computation, 255, 2017, 147
Alasdair Urquhart, 3959, Theory and Applications of Models of Computation, 2006, 79
Albert Atserias, Moritz Muller, Sergi Oliva, 2013 IEEE Conference on Computational Complexity, 2013, 109
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
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
Jan Krajíček, Proof Complexity, 2019