Alexandre Albore, Natasha Alechina, Piergiorgio Bertoli, Chiara Ghidini, Brian Logan, 5405, Computational Logic in Multi-Agent Systems, 2009, 77
Alexander Razborov, “Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution”, Ann. Math., 181, no. 2, 2015, 415
Yuval Filmus, Massimo Lauria, Jakob Nordstrom, Neil Thapen, Noga Ron-Zewi, 2012 IEEE 27th Conference on Computational Complexity, 2012, 334
Massimo Lauria, “Cliques enumeration and tree-like resolution proofs”, Information Processing Letters, 135, 2018, 62
Alexander Razborov, “Guest Column”, SIGACT News, 47, no. 2, 2016, 66
Susanna F. de Rezende, Jakob Nordstrom, Marc Vinyals, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 2016, 295
Mladen Mikša, Jakob Nordström, 8561, Theory and Applications of Satisfiability Testing – SAT 2014, 2014, 121
Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan, “Space proof complexity for random 3-CNFs”, Information and Computation, 255, 2017, 165
Yuval Filmus, “Another look at degree lower bounds for polynomial calculus”, Theoretical Computer Science, 796, 2019, 286
Matti Järvisalo, Arie Matsliah, Jakob Nordström, Stanislav Živný, 7514, Principles and Practice of Constraint Programming, 2012, 316