Albert Atserias, Massimo Lauria, Jakob Nordstrom, 2014 IEEE 29th Conference on Computational Complexity (CCC), 2014, 286
A. Atserias, V. Dalmau, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., 2003, 239
Jakob Nordström, Johan Håstad, Proceedings of the fortieth annual ACM symposium on Theory of computing, 2008, 701
Olaf Beyersdorff, Sebastian Müller, 6108, Theory and Applications of Models of Computation, 2010, 50
Joshua A. Grochow, Toniann Pitassi, “Circuit Complexity, Proof Complexity, and Polynomial Identity Testing”, J. ACM, 65, no. 6, 2018, 1
Jacobo Torán, Florian Wörz, “Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space”, comput. complex., 30, no. 1, 2021, 7
Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson, “Pseudorandom Generators in Propositional Proof Complexity”, SIAM J. Comput., 34, no. 1, 2004, 67
Olaf Beyersdorff, Oliver Kullmann, 8561, Theory and Applications of Satisfiability Testing – SAT 2014, 2014, 170
Natasha Alechina, Brian Logan, Hoang Nga Nguyen, Abdur Rakib, “Verifying time, memory and communication bounds in systems of reasoning agents”, Synthese, 169, no. 2, 2009, 385
Jakob Nordström, “Narrow Proofs May Be Spacious:Separating Space and Width in Resolution”, SIAM J. Comput., 39, no. 1, 2009, 59