Jakob Nordström

Jakob Nordström

Professor

Member of:


    1. 2023
    2. 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 journalJournal articleResearchpeer-review

    3. 2021
    4. 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 journalJournal articleResearchpeer-review

    5. 2020
    6. Published

      Supercritical space-width trade-offs for resolution

      Berkholz, C. & Nordström, Jakob, 2020, In: SIAM Journal on Computing. 49, 1, p. 98-118

      Research output: Contribution to journalJournal articleResearchpeer-review

    7. 2017
    8. 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 journalJournal articleResearchpeer-review

    9. 2016
    10. 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 journalJournal articleResearchpeer-review

    11. 2015
    12. 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 journalJournal articleResearchpeer-review

    13. 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 journalJournal articleResearchpeer-review

    14. 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 journalJournal articleResearchpeer-review

    15. 2013
    16. 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 journalJournal articleResearchpeer-review

    17. 2012
    18. 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 journalJournal articleResearchpeer-review

    Previous 1 2 Next

    ID: 209376262