Albert Atserias, 7962, Theory and Applications of Satisfiability Testing – SAT 2013, 2013, 1
Albert Atserias, Moritz Muller, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, 498
Max Gläser, Marc E. Pfetsch, 13265, Integer Programming and Combinatorial Optimization, 2022, 291
Susanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, 209
Sebastian Müller, Iddo Tzameret, “Short propositional refutations for dense random 3CNF formulas”, Annals of Pure and Applied Logic, 165, no. 12, 2014, 1864
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander Razborov, 6755, Automata, Languages and Programming, 2011, 630
Jakob Nordström, “On the interplay between proof complexity and SAT solving”, ACM SIGLOG News, 2, no. 3, 2015, 19
Iddo Tzameret, 8572, Automata, Languages, and Programming, 2014, 1015
Nicola Galesi, Massimo Lauria, “On the Automatizability of Polynomial Calculus”, Theory Comput Syst, 47, no. 2, 2010, 491
Michael Alekhnovich, Alexander Razborov, “Satisfiability, Branch-Width and Tseitin tautologies”, comput. complex., 20, no. 4, 2011, 649