Jakob Nordström

Jakob Nordström

Professor

Member of:

    ORCID: 0000-0002-2700-4285

    Publication year:
    All
    21 - 30 out of 71Page size: 10
    Sort by: Title

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

    2. Published

      Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz

      Conneryd, J., de Rezende, S. F., Nordström, Jakob, Pang, Shuo & Risse, K., 2023, Proceedings - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, FOCS 2023. IEEE Computer Society Press, 11 p. 45. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

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

    4. Hardness of Approximation in PSPACE and Separation Results for Pebble Games (Extended Abstract)

      Chan, S. M., Lauria, M., Nordström, Jakob & Vinyals, M., 1 Oct 2015, Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'15). IEEE, p. 466-485 20 p.

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

    5. Published

      Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning

      Mexi, G., Berthold, T., Gleixner, A. & Nordström, Jakob, 2023, 29th International Conference on Principles and Practice of Constraint Programming, CP 2023. Yap, R. H. C. Y. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 19 p. 27. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 280).

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

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

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

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

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

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

    Previous 1 2 3 4 5 6 7 8 Next

    ID: 209376262