Christoph Berkholz, Jakob Nordström, “Supercritical Space-Width Trade-offs for Resolution”, SIAM J. Comput., 49, no. 1, 2020, 98
Jakob Nordström, Alexander Razborov, 6755, Automata, Languages and Programming, 2011, 642
Yuval Filmus, Massimo Lauria, Mladen Mikša, Jakob Nordström, Marc Vinyals, “From Small Space to Small Width in Resolution”, ACM Trans. Comput. Logic, 16, no. 4, 2015, 1
Moritz Müller, Stefan Szeider, “The treewidth of proofs”, Information and Computation, 255, 2017, 147
Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen, “Space Complexity in Polynomial Calculus”, SIAM J. Comput., 44, no. 4, 2015, 1119
Eli Ben-Sasson, Jakob Nordström, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 2008, 709
Daniela Kaufmann, Paul Beame, Armin Biere, Jakob Nordstrom, 2022 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2022, 1431
Iddo Tzameret, 6108, Theory and Applications of Models of Computation, 2010, 60
Albert Atserias, Massimo Lauria, Jakob Nordström, “Narrow Proofs May Be Maximally Long”, ACM Trans. Comput. Logic, 17, no. 3, 2016, 1
Zhengzhong Jin, Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 1750