Jakob Nordström

Jakob Nordström

Professor

Member of:


    1. Published

      Short proofs may be spacious: An optimal separation of space and length in resolution

      Ben-Sasson, E. & Nordström, Jakob, 2008, Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. p. 709-718 10 p. 4691003. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

    2. Published

      Simplified and Improved Separations Between Regular and General Resolution by Lifting

      Vinyals, M., Elffers, J., Johannsen, J. & Nordström, Jakob, 2020, Theory and Applications of Satisfiability Testing – SAT 2020 - 23rd International Conference, Proceedings. Pulina, L. & Seidl, M. (eds.). Springer, p. 182-200 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12178 LNCS).

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

    3. Some trade-off results for polynomial calculus

      Beck, C., Nordström, Jakob & Tang, B., 2013, STOC 2013 - Proceedings of the 2013 ACM Symposium on Theory of Computing. p. 813-822 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    4. Space complexity in polynomial calculus

      Filmus, Y., Lauria, M., Nordström, Jakob, Ron-Zewi, N. & Thapen, N., 2015, In: SIAM Journal on Computing. 44, 4, p. 1119-1153 35 p.

      Research output: Contribution to journalJournal articleResearchpeer-review

    5. Space complexity in polynomial calculus

      Filmus, Y., Lauria, M., Nordström, Jakob, Thapen, N. & Ron-Zewi, N., 2012, Proceedings - 2012 IEEE 27th Conference on Computational Complexity, CCC 2012. p. 334-344 11 p. 6243410. (Proceedings of the Annual IEEE Conference on Computational Complexity).

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

    6. Published

      Stålmarck's Method Versus Resolution: a Comparative Theoretical Study

      Nordström, Jakob, 2001

      Research output: Book/ReportReportResearch

    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). International Joint Conferences on Artificial Intelligence, p. 1134-1140 7 p.

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

    8. Published

      Supercritical space-width trade-offs for resolution

      Berkholz, C. & Nordström, Jakob, 2020, In: SIAM Journal on Computing. 49, 1, p. 98-118

      Research output: Contribution to journalJournal articleResearchpeer-review

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

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

    ID: 209376262