Jakob Nordström

Jakob Nordström

Professor

Member of:

    ORCID: 0000-0002-2700-4285

    Publication year:
    All
    1 - 10 out of 14Page size: 10
    Sort by: Title
    1. 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

    2. 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

    3. 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

    4. 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

    5. 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

    6. 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

    7. 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

    8. 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

    9. 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

    10. 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

    Previous 1 2 Next

    ID: 209376262