Jakob Nordström

Jakob Nordström

Professor

Member of:

    ORCID: 0000-0002-2700-4285

    Publication year:
    All
    1 - 4 out of 4Page size: 10
    1. 2021
    2. Published

      Automating algebraic proof systems is NP-hard

      De Rezende, S. F., Göös, M., Nordström, Jakob, Pitassi, T., Robere, R. & Sokolov, D., 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, Inc., p. 209-222

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

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

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

    5. Published

      The Power of Negative Reasoning

      de Rezende, S. F., Lauria, M., Nordström, Jakob & Sokolov, D., 2021, 36th Computational Complexity Conference, CCC 2021. Kabanets, V. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 24 p. 40. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 200).

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

    ID: 209376262