Moritz Müller, Ján Pich, “Feasibly constructive proofs of succinct weak circuit lower bounds”, Annals of Pure and Applied Logic, 171:2 (2020), 102735
Jan Krajíček, Proof Complexity, 2019
Jan Pich, Rahul Santhanam, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, 1305
Pavel Pudlák, Neil Thapen, “Random resolution refutations”, comput. complex., 28:2 (2019), 185
Fu Li, Iddo Tzameret, Zhengyu Wang, “Characterizing Propositional Proofs as Noncommutative Formulas”, SIAM J. Comput., 47:4 (2018), 1424
Moritz Müller, Stefan Szeider, “The treewidth of proofs”, Information and Computation, 255 (2017), 147
PAVEL PUDLÁK, “INCOMPLETENESS IN THE FINITE DOMAIN”, Bull. symb. log, 23:4 (2017), 405
Toniann Pitassi, Iddo Tzameret, “Algebraic proof complexity”, ACM SIGLOG News, 3:3 (2016), 21
Alexander Razborov, “Guest Column”, SIGACT News, 47:2 (2016), 66
A. Atserias, M. Müller, S. Oliva, “Lower bounds for DNF-refutations of a relativized weak pigeonhole principle”, J. Symb. Log., 80:2 (2015), 450–476