Pavel Pudlák, 5010, Computer Science – Theory and Applications, 2008, 13
Iddo Tzameret, 6108, Theory and Applications of Models of Computation, 2010, 60
Alexander Razborov, “Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution”, Ann. Math., 181, no. 2, 2015, 415
Michael Alekhnovich, “Lower Bounds for k-DNF Resolution on Random 3-CNFs”, comput. complex., 20, no. 4, 2011, 597
Olaf Beyersdorff, “On the correspondence between arithmetic theories and propositional proof systems – a survey”, Mathematical Logic Qtrly, 55, no. 2, 2009, 116
Moritz Müller, Ján Pich, “Feasibly constructive proofs of succinct weak circuit lower bounds”, Annals of Pure and Applied Logic, 171, no. 2, 2020, 102735
Massimo Lauria, Pavel Pudlák, Vojtěch Rödl, Neil Thapen, “The complexity of proving that a graph is Ramsey”, Combinatorica, 37, no. 2, 2017, 253
Michael Alekhnovich, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, 2005, 251
Rahul Santhanam, Iddo Tzameret, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, 234
Fu Li, Iddo Tzameret, Zhengyu Wang, “Characterizing Propositional Proofs as Noncommutative Formulas”, SIAM J. Comput., 47, no. 4, 2018, 1424