Ján Pich, “Learning algorithms from circuit lower bounds”, comput. complex., 34:1 (2025)
Rahul Santhanam, Iddo Tzameret, “Iterated Lower Bound Formulas: A Diagonalization-Based Approach to Proof Complexity”, SIAM J. Comput., 2025, STOC21-313
Albert Atserias, Sam Buss, Moritz Müller, “On the consistency of circuit lower bounds for non-deterministic time”, J. Math. Log., 25:03 (2025)
Stefan Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin, “Proof Complexity and the Binary Encoding of Combinatorial Principles”, SIAM J. Comput., 53:3 (2024), 764
Dmitry Sokolov, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 2008
Yilei Chen, Jiatu Li, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 620
Erfan Khaniki, 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, 573
Noah Fleming, Toniann Pitassi, Outstanding Contributions to Logic, 22, Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs, 2022, 497
Hanlin Ren, Rahul Santhanam, Zhikun Wang, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 640
Lijie Chen, Shuichi Hirahara, Igor Carboni Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam, “Beyond Natural Proofs: Hardness Magnification and Locality”, J. ACM, 69:4 (2022), 1