Jakob Nordström

Jakob Nordström

Professor

Member of:

    ORCID: 0000-0002-2700-4285

    Publication year:
    All
    26 - 50 out of 71Page size: 25
    Sort by: Title

    1. In between resolution and cutting planes: A study of proof systems for pseudo-boolean SAT solving

      Vinyals, M., Elffers, J., Giráldez-Cru, J., Gocht, S. & Nordström, Jakob, 2018, Theory and Applications of Satisfiability Testing – SAT 2018 - 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings. Beyersdorff, O. & Wintersteiger, C. M. (eds.). Springer Verlag, p. 292-310 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 10929 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    2. Published

      Justifying All Differences Using Pseudo-Boolean Reasoning

      Elffers, J., Gocht, S., McCreesh, C. & Nordström, Jakob, 1 Feb 2020, Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI '20). AAAI Press, p. 1486-1494 9 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    3. Published

      KRW Composition Theorems via Lifting

      de Rezende, S., Meir, O., Nordström, Jakob, Pitassi, T. & Robere, R., 1 Nov 2020, Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS '20). IEEE, p. 4149

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    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 journal › Journal article › Research › peer-review

    5. Published

      Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity

      de Rezende, S. F., Meir, O., Nordström, Jakob, Pitassi, T., Robere, R. & Vinyals, M., 1 Nov 2020, Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS '20). IEEE, p. 24-30

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    6. Long Proofs of (Seemingly) Simple Formulas

      Mikša, M. & Nordström, Jakob, 2014, Theory and Applications of Satisfiability Testing, SAT 2014 - 17th International Conference, Held as Part of theVienna Summer of Logic, VSL 2014, Proceedings. Springer Verlag, p. 121-137 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 8561 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

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

    8. Narrow proofs may be maximally long

      Atserias, A., Lauria, M. & Nordström, Jakob, 2014, Proceedings - IEEE 29th Conference on Computational Complexity, CCC 2014. IEEE Computer Society Press, p. 286-297 12 p. 6875497. (Proceedings of the Annual IEEE Conference on Computational Complexity).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

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

    10. Published

      Narrow proofs may be spacious: Separating space and width in resolution

      Nordström, Jakob, 2006, STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. p. 507-516 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing, Vol. 2006).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    11. Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler - Leman Refinement Steps

      Berkholz, C. & Nordström, Jakob, 5 Jul 2016, Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science, LICS 2016. Institute of Electrical and Electronics Engineers Inc., p. 267-276 10 p. (Proceedings - Symposium on Logic in Computer Science, Vol. 05-08-July-2016).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

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

    13. Published

      Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

      de Rezende, S. F., Nordström, Jakob, Meir, O. & Robere, R., 2019, 34th Computational Complexity Conference (CCC 2019), Proceedings. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Vol. 137. p. 1-16 18. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 137).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    14. Published

      On division versus saturation in pseudo-boolean solving

      Gocht, S., Nordström, Jakob & Yehudayoff, A., 2019, Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019. Kraus, S. (ed.). International Joint Conferences on Artificial Intelligence, p. 1711-1718

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    15. Published

      On minimal unsatisfiability and time-space trade-offs for k-DNF resolution

      Nordström, Jakob & Razborov, A., 2011, Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings. PART 1 ed. p. 642-653 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); No. PART 1, Vol. 6755 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

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

    17. On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity (Extended Abstract)

      Huynh, T. & Nordström, Jakob, 1 May 2012, Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC '12). Association for Computing Machinery, Inc., p. 233-248 16 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    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 journal › Journal article › Research › peer-review

    19. Published

      On the relative strength of pebbling and resolution

      Nordström, Jakob, 2010, Proceedings - 25th Annual IEEE Conference on Computational Complexity, CCC 2010. p. 151-162 12 p. 5497889. (Proceedings of the Annual IEEE Conference on Computational Complexity).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

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

    21. Published

      Proof Complexity and SAT Solving

      Buss, S. & Nordström, Jakob, 2021, Handbook of Satisfiability. Biere, A., Heule, M. J. H., van Maaren, H. & Walsh, T. (eds.). 2 ed. IMIA and IOS Press, p. 233 - 350 (Frontiers in Artificial Intelligence and Applications, Vol. 336).

      Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review

    22. Relating proof complexity measures and practical hardness of SAT

      Järvisalo, M., Matsliah, A., Nordström, Jakob & Živný, S., 2012, Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Proceedings. p. 316-331 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 7514 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    23. Seeking practical CDCL insights from theoretical SAT benchmarks

      Elffers, J., Cru, J. G., Gocht, S., Nordström, Jakob & Simon, L., 2018, Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. Lang, J. (ed.). International Joint Conferences on Artificial Intelligence, p. 1300-1308 9 p. (IJCAI International Joint Conference on Artificial Intelligence, Vol. 2018-July).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    24. Published

      Separations of Matroid Freeness Properties

      Bhattacharyya, A., Grigorescu, E., Nordström, Jakob & Xie, N., 1 Aug 2010.

      Research output: Working paper › Research

    25. Published

      Short Proofs May Be Spacious: Understanding Space in Resolution

      Nordström, Jakob, 1 May 2008

      Research output: Book/Report › Report › Research › peer-review

    Previous 1 2 3 Next

    ID: 209376262