Jakob Nordström

Jakob Nordström

Professor, Associate Professor


  1. 2020
  2. 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).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

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

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-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, 1 Sep 2020, Proceedings of the 17th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR '20). p. xxiv-xxv

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  5. Published

    Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning

    Liew, V., Beame, P., Devriendt, J., Elffers, J. & Nordström, Jakob, 1 Sep 2020, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design (FMCAD '20). p. 194-204 11 p.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  6. Published

    Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs

    de Rezende, S. F., Nordström, Jakob, Risse, K. & Sokolov, D., 1 Jul 2020, 35th Computational Complexity Conference, CCC 2020. Saraf, S. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 28. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 169).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  7. Published

    Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions

    Gocht, S., McCreesh, C. & Nordström, Jakob, 1 Jul 2020, Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI '20). p. 1134-1140 7 p.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  8. Published

    Automating Algebraic Proof Systems is NP-Hard

    de Rezende, S. F., Göös, M., Nordström, Jakob, Pitassi, T., Robere, R. & Sokolov, D., 1 May 2020.

    Research output: Working paperResearch

  9. Published

    A Cardinal Improvement to Pseudo-Boolean Solving

    Elffers, J. & Nordström, Jakob, 1 Feb 2020, Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI '20). AAAI Press, p. 1495-1503 9 p.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  10. 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 proceedingArticle in proceedingsResearchpeer-review

  11. Published

    Trade-offs between size and degree in polynomial calculus

    Lagarde, G., Nordström, Jakob, Sokolov, D. & Swernofsky, J., Jan 2020, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020. Vidick, T. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 72. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 151).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Previous 1 2 3 4 5 6 Next

ID: 209376262