Jakob Nordström, 2010 IEEE 25th Annual Conference on Computational Complexity, 2010, 151
George Katsirelos, Laurent Simon, 7317, Theory and Applications of Satisfiability Testing – SAT 2012, 2012, 496
Siu Man Chan, 2013 IEEE Conference on Computational Complexity, 2013, 133
Jacobo Torán, Florian Wörz, “Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas”, ACM Trans. Comput. Logic, 24, № 3, 2023, 1
Ilario Bonacina, Nicola Galesi, Neil Thapen, “Total Space in Resolution”, SIAM J. Comput., 45, № 5, 2016, 1894
A. Borodin, T. Pitassi, A. Razborov, “Special Issue In Memory of Misha Alekhnovich. Foreword”, comput. complex., 20, № 4, 2011, 579
Yuval Filmus, Massimo Lauria, Mladen Mikša, Jakob Nordström, Marc Vinyals, 7965, Automata, Languages, and Programming, 2013, 437
Kazuhisa SETO, “An Introduction to Lower Bounds on Resolution Proof Systems”, IIS, 21, № 4, 2015, 307
Juan Luis Esteban, Nicola Galesi, Jochen Messner, “On the complexity of resolution with bounded conjunctions”, Theoretical Computer Science, 321, № 2-3, 2004, 347
Massimo Lauria, “A note about k -DNF resolution”, Information Processing Letters, 137, 2018, 33