Shachar Lovett, Kewen Wu, Jiapeng Zhang, “Decision List Compression by Mild Random Restrictions”, J. ACM, 68:6 (2021), 1
Rahul Santhanam, Iddo Tzameret, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, 234
Shachar Lovett, Kewen Wu, Jiapeng Zhang, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, 247
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