Jakob Nordström
Professor
- 2024
- Published
End-to-End Verification for Subgraph Solving
Gocht, S., McCreesh, C., Myreen, M. O., Nordström, Jakob, Oertel, A. & Tan, Y. K., 2024, In: Proceedings of the AAAI Conference on Artificial Intelligence. 38, 8, p. 8038-8047 10 p.Research output: Contribution to journal › Conference article › Research › peer-review
- 2023
- Published
Certified Dominance and Symmetry Breaking for Combinatorial Optimisation
Bogaerts, B., Gocht, S., McCreesh, C. & Nordström, Jakob, 2023, In: Journal of Artificial Intelligence Research. 77, p. 1539-1589 51 p.Research output: Contribution to journal › Journal article › Research › peer-review
- Published
Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps
Berkholz, C. & Nordström, Jakob, 2023, In: Journal of the ACM. 70, 5, p. 1-32 32.Research output: Contribution to journal › Journal article › Research › peer-review
- 2021
- Published
Learn to Relax: Integrating 0-1 Integer Linear Programming with Pseudo-Boolean Conflict-Driven Search
Devriendt, J., Gleixner, A. & Nordström, Jakob, 2021, In: Constraints. 26, p. 26–55 30 p.Research output: Contribution to journal › Journal article › Research › peer-review
- 2020
- Published
Supercritical space-width trade-offs for resolution
Berkholz, C. & Nordström, Jakob, 2020, In: SIAM Journal on Computing. 49, 1, p. 98-118Research output: Contribution to journal › Journal article › Research › peer-review
- 2017
Tight Size-Degree Bounds for Sums-of-Squares Proofs
Lauria, M. & Nordström, Jakob, 1 Dec 2017, In: Computational Complexity. 26, 4, p. 911-948 38 p.Research output: Contribution to journal › Journal article › Research › peer-review
- 2016
Narrow proofs may be maximally long
Atserias, A., Lauria, M. & Nordström, Jakob, Feb 2016, In: ACM Transactions on Computational Logic. 17, 3, 19.Research output: Contribution to journal › Journal article › Research › peer-review
- 2015
From small space to small width in resolution
Filmus, Y., Lauria, M., Mikša, M., Nordström, Jakob & Vinyals, M., 1 Aug 2015, In: ACM Transactions on Computational Logic. 16, 4, 28.Research output: Contribution to journal › Journal article › Research › peer-review
On the Interplay Between Proof Complexity and SAT Solving
Nordström, Jakob, 1 Jul 2015, In: ACM SIGLOG News. 2, 3, p. 19-44 26 p.Research output: Contribution to journal › Journal article › Research › peer-review
Space complexity in polynomial calculus
Filmus, Y., Lauria, M., Nordström, Jakob, Ron-Zewi, N. & Thapen, N., 2015, In: SIAM Journal on Computing. 44, 4, p. 1119-1153 35 p.Research output: Contribution to journal › Journal article › Research › peer-review
- 2013
Pebble games, proof complexity, and time-space trade-offs
Nordström, Jakob, 13 Sep 2013, In: Logical Methods in Computer Science. 9, 3, 15.Research output: Contribution to journal › Journal article › Research › peer-review
- 2012
On the relative strength of pebbling and resolution
Nordström, Jakob, Apr 2012, In: ACM Transactions on Computational Logic. 13, 2, a16.Research output: Contribution to journal › Journal article › Research › peer-review
- 2009
- Published
A simplified way of proving trade-off results for resolution
Nordström, Jakob, 31 Aug 2009, In: Information Processing Letters. 109, 18, p. 1030-1035 6 p.Research output: Contribution to journal › Journal article › Research › peer-review
- Published
Narrow proofs may be spacious: Separating space and width in resolution
Nordström, Jakob, 2009, In: SIAM Journal on Computing. 39, 1, p. 59-121 63 p.Research output: Contribution to journal › Journal article › Research › peer-review
ID: 209376262
Most downloads
-
69
downloads
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
33
downloads
Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
25
downloads
Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published