Jakob Nordström, “On the Relative Strength of Pebbling and Resolution”, ACM Trans. Comput. Logic, 13, № 2, 2012, 1
Paul Beame, Chris Beck, Russell Impagliazzo, “Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space”, SIAM J. Comput., 45, № 4, 2016, 1612
Tuomas Hakoniemi, 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, 1
Nathan Segerlind, “The Complexity of Propositional Proofs”, Bull. symb. log., 13, № 4, 2007, 417
Jakob Nordström, “A simplified way of proving trade-off results for resolution”, Information Processing Letters, 109, № 18, 2009, 1030
Philipp Hertel, Toniann Pitassi, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 2007, 137
Moritz Müller, Stefan Szeider, 8087, Mathematical Foundations of Computer Science 2013, 2013, 704
Nicola Galesi, Leszek Kolodziejczyk, Neil Thapen, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, 1325
Alexander Razborov, “On Space and Depth in Resolution”, comput. complex., 27, № 3, 2018, 511
Jacobo Torán, Perspectives in Computational Complexity, 2014, 159