Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, “Parameterized Complexity of DPLL Search Procedures”, ACM Trans. Comput. Logic, 14, № 3, 2013, 1
Arnold Beckmann, Pavel Pudlák, Neil Thapen, 8087, Mathematical Foundations of Computer Science 2013, 2013, 111
Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals, 9710, Theory and Applications of Satisfiability Testing – SAT 2016, 2016, 160
Dániel Marx, 2010 IEEE 25th Annual Conference on Computational Complexity, 2010, 181
A. Borodin, T. Pitassi, A. Razborov, “Special Issue In Memory of Misha Alekhnovich. Foreword”, comput. complex., 20, № 4, 2011, 579
Arnold Beckmann, Pavel Pudlák, Neil Thapen, “Parity Games and Propositional Proofs”, ACM Trans. Comput. Logic, 15, № 2, 2014, 1
Dániel Marx, “Completely inapproximable monotone and antimonotone parameterized problems”, Journal of Computer and System Sciences, 79, № 1, 2013, 144
Brendan Juba, Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015, 93
Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, 68
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov, “Parameterized Bounded-Depth Frege Is not Optimal”, ACM Trans. Comput. Theory, 4, № 3, 2012, 1