Jakob Nordström

Jakob Nordström

Professor

Member of:

    ORCID: 0000-0002-2700-4285

    Publication year:
    All
    31 - 40 out of 66Page size: 10
    1. 2016

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

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

    4. Supercritical space-width trade-offs for resolution

      Berkholz, C. & Nordström, Jakob, 1 Aug 2016, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. Rabani, Y., Chatzigiannakis, I., Sangiorgi, D. & Mitzenmacher, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 57. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 55).

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

    5. 2017

    6. CNFgen: A generator of crafted benchmarks

      Lauria, M., Elffers, J., Nordström, Jakob & Vinyals, M., 2017, Theory and Applications of Satisfiability Testing – SAT 2017 - 20th International Conference, Proceedings. Gaspers, S. & Walsh, T. (eds.). Springer Verlag, p. 464-473 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 10491 LNCS).

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

    7. Graph colouring is hard for algorithms based on hilbert's nullstellensatz and gröbner bases

      Lauria, M. & Nordström, Jakob, 1 Jul 2017, 32nd Computational Complexity Conference, CCC 2017. O'Donnell, R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 79).

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

    8. Cumulative space in black-white pebbling and resolution

      Alwen, J., De Rezende, S. F., Nordström, Jakob & Vinyals, M., 1 Nov 2017, 8th Innovations in Theoretical Computer Science Conference, ITCS 2017. Papadimitriou, C. H. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 67).

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

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

    10. 2018

    11. Divide and conquer: Towards faster pseudo-boolean solving

      Elffers, J. & Nordström, Jakob, 2018, Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. Lang, J. (ed.). International Joint Conferences on Artificial Intelligence, p. 1291-1299 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

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

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

    Previous 1 2 3 4 5 6 7 Next

    ID: 209376262