Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström, 10929, Theory and Applications of Satisfiability Testing – SAT 2018, 2018, 292
Eugene Goldberg, Panagiotis Manolios, Advanced Techniques in Logic Synthesis, Optimizations and Applications, 2011, 109
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, 6695, Theory and Applications of Satisfiability Testing - SAT 2011, 2011, 5
Alexander Razborov, “On Space and Depth in Resolution”, comput. complex., 27, no. 3, 2018, 511
Jan Krajíček, Proof Complexity, 2019
Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova, “Bounded-depth Frege complexity of Tseitin formulas for all graphs”, Annals of Pure and Applied Logic, 174, no. 1, 2023, 103166
Albert Atserias, Moritz Müller, “Automating Resolution is NP-Hard”, J. ACM, 67, no. 5, 2020, 1
Susanna F. de Rezende, “Automating Tree-Like Resolution in Time n(log ) Is ETH-Hard”, Procedia Computer Science, 195, 2021, 152
Max Gläser, Marc E. Pfetsch, “On computing small variable disjunction branch-and-bound trees”, Math. Program., 2023
Eugene Goldberg, Panagiotis Manolios, 6504, Hardware and Software: Verification and Testing, 2011, 93