Nicola Galesi, Leszek Kolodziejczyk, Neil Thapen, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, 1325
Jakob Nordström, “On the interplay between proof complexity and SAT solving”, ACM SIGLOG News, 2, no. 3, 2015, 19
S. Dantchev, Proceedings 17th IEEE Annual Conference on Computational Complexity, 2002, 39
Moritz Müller, Stefan Szeider, 8087, Mathematical Foundations of Computer Science 2013, 2013, 704
Nathan Segerlind, Sam Buss, Russell Impagliazzo, “A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution”, SIAM J. Comput., 33, no. 5, 2004, 1171
Jakob Nordström, “Narrow Proofs May Be Spacious:Separating Space and Width in Resolution”, SIAM J. Comput., 39, no. 1, 2009, 59
Nathan Segerlind, “The Complexity of Propositional Proofs”, Bull. symb. log., 13, no. 4, 2007, 417
Samuel R. Buss, “Towards NP–P via proof complexity and search”, Annals of Pure and Applied Logic, 163, no. 7, 2012, 906
ALBERT ATSERIAS, MORITZ MÜLLER, SERGI OLIVA, “LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE”, J. symb. log., 80, no. 2, 2015, 450
Stefan Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin, “Proof Complexity and the Binary Encoding of Combinatorial Principles”, SIAM J. Comput., 53, no. 3, 2024, 764