Get started
Author

Jakob Nordstr”öm

Observed names: Eli Ben-Sasson, Jakob Nordström, Jakob Nordstr, Jakob Nordstrom, Jakob Nordstr”m, Jakob Nordström, Jakob Nordström Underst, Jakob, Nordström, Nordstrom Jakob, Nordstrom, Jakob, Nordström, Jakob, Nordström, Jakob
Observed institutions: University of Copenhagen, Vrije Universiteit Brussel, Lund University, MIT Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, University of Glasgow, KTH Royal Institute of Technology
ORCID: 0000-0002-2700-4285
Observed ORCID: 0000-0002-2700-4285
OpenAlex ID: A5003633660
Pebble Games, Proof Complexity, and Time-Space Trade-offs
2013 · Jakob Nordstrom · Logical Methods in Computer Science · 96
PDF
Divide and Conquer: Towards Faster Pseudo-Boolean Solving
2018 · Jan Elffers, Jakob Nordström · International Joint Conference on Artificial Intelligence · 83
PDF
On the interplay between proof complexity and SAT solving
2015 · Jakob Nordström · ACM SIGLOG News · 70
Narrow Proofs May Be Spacious:Separating Space and Width in Resolution
2009 · Jakob Nordström · SIAM Journal on Computing · 69
On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity
2012 · Trinh Huynh, Jakob Nordstrom · ACM Symposium on Theory of Computing (STOC) · 67
Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution
2008 · Eli Ben-Sasson, Jakob Nordström · Annual Symposium on Foundations of Computer Science · 63
Narrow Proofs May Be Maximally Long
2016 · Albert Atserias, Massimo Lauria, et al. · ACM Transactions on Computational Logic · 62
Chapter 7. Proof Complexity and SAT Solving
2021 · Sam Buss, Jakob Nordström · Frontiers in artificial intelligence and applications · 49
Certified Dominance and Symmetry Breaking for Combinatorial Optimisation
2023 · Bart Bogaerts, Stephan Gocht, et al. · Journal of Artificial Intelligence Research · 44
PDF
Some trade-off results for polynomial calculus: extended abstract
2013 · Chris Beck, Jakob Nordstrom, et al. · ACM Symposium on Theory of Computing (STOC) · 43
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity)
2016 · Susanna F. de Rezende, Jakob Nordstrom, et al. · Annual Symposium on Foundations of Computer Science · 42
Space Complexity in Polynomial Calculus
2015 · Yuval Filmus, Massimo Lauria, et al. · SIAM Journal on Computing · 40
Untitled
2013 · Jakob Nordstrom, Johan Haastad · Theory of Computing · 40
PDF
CNFgen: A Generator of Crafted Benchmarks
2017 · Massimo Lauria, Jan Elffers, et al. · Lecture notes in computer science · 39
From Small Space to Small Width in Resolution
2015 · Yuval Filmus, Massimo Lauria, et al. · ACM Transactions on Computational Logic · 38
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs
2021 · Stephan Gocht, Jakob Nordström · Proceedings of the AAAI Conference on Artificial Intelligence · 34
Short Proofs May Be Spacious : Understanding Space in Resolution
2008 · Jakob Nordstr”öm · 34
On the Relative Strength of Pebbling and Resolution
2012 · Jakob Nordström · ACM Transactions on Computational Logic · 32
PDF
Justifying All Differences Using Pseudo-Boolean Reasoning
2020 · Jan Elffers, Stephan Gocht, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 30
PDF
Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning
2021 · Jo Devriendt, Stephan Gocht, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 29
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks
2018 · Jan Elffers, Jesús Giráldez-Cru, et al. · International Joint Conference on Artificial Intelligence · 29
PDF
Certified Core-Guided MaxSAT Solving
2023 · Jeremias Berg, Bart Bogaerts, et al. · Lecture notes in computer science · 27
PDF
Relating Proof Complexity Measures and Practical Hardness of SAT
2012 · Matti Järvisalo, Arie Matsliah, et al. · Lecture notes in computer science · 27
A simplified way of proving trade-off results for resolution
2009 · Jakob Nordström · Information Processing Letters · 26
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving
2018 · Marc Vinyals, Jan Elffers, et al. · Lecture notes in computer science · 25
Works count: 166
Citation count: 1,889
H-index: 25
I10-index: 57
Year
Topic
Type