Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals, 10491, Theory and Applications of Satisfiability Testing – SAT 2017, 2017, 464
Juan Luis Esteban, Jacobo Torán, “A combinatorial characterization of treelike resolution space”, Information Processing Letters, 87, № 6, 2003, 295
Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals, 9710, Theory and Applications of Satisfiability Testing – SAT 2016, 2016, 160
Albert Atserias, Víctor Dalmau, “A combinatorial characterization of resolution width”, Journal of Computer and System Sciences, 74, № 3, 2008, 323
Alexander Hertel, Alasdair Urquhart, 4646, Computer Science Logic, 2007, 527
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
Nicola Galesi, Navid Talebanfard, Jacobo Torán, “Cops-Robber Games and the Resolution of Tseitin Formulas”, ACM Trans. Comput. Theory, 12, № 2, 2020, 1
Daniela Kaufmann, Mathias Fleury, Armin Biere, Manuel Kauers, “Practical algebraic calculus and Nullstellensatz with the checkers Pacheck and Pastèque and Nuss-Checker”, Form Methods Syst Des, 2022
Ilario Bonacina, Nicola Galesi, Neil Thapen, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014, 641
Brendan Juba, Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015, 93