Jakob Nordström

Jakob Nordström

Professor

Member of:

    ORCID: 0000-0002-2700-4285

    Publication year:
    All
    61 - 70 out of 71Page size: 10
    Sort by: 1st author
    1. Published

      Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps

      Berkholz, C. & Nordström, Jakob, 2023, In: Journal of the ACM. 70, 5, p. 1-32 32.

      Research output: Contribution to journal › Journal article › Research › peer-review

    2. 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 journal › Journal article › Research › peer-review

    3. Published

      Certified Core-Guided MaxSAT Solving

      Berg, J., Bogaerts, B., Nordström, Jakob, Oertel, A. & Vandesande, D., 2023, Automated Deduction – CADE 29 - 29th International Conference on Automated Deduction, Proceedings. Pientka, B. & Tinelli, C. (eds.). Springer Science and Business Media Deutschland GmbH, p. 1-22 22 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 14132 LNAI).

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

    4. Published

      Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions

      Ben-Sasson, E. & Nordström, Jakob, 1 Aug 2010.

      Research output: Working paper › Research

    5. Published

      A Space Hierarchy for $k$-DNF Resolution

      Ben-Sasson, E. & Nordström, Jakob, 1 Apr 2009.

      Research output: Working paper › Research

    6. 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 proceeding › Article in proceedings › Research › peer-review

    7. 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 proceeding › Article in proceedings › Research › peer-review

    8. Narrow proofs may be maximally long

      Atserias, A., Lauria, M. & Nordström, Jakob, 2014, Proceedings - IEEE 29th Conference on Computational Complexity, CCC 2014. IEEE Computer Society Press, p. 286-297 12 p. 6875497. (Proceedings of the Annual IEEE Conference on Computational Complexity).

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

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

    10. Clique is hard on average for regular resolution

      Atserias, A., Lauria, M., Bonacina, I., Nordström, Jakob, De Rezende, S. F. & Razborov, A., 20 Jun 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Henzinger, M., Kempe, D. & Diakonikolas, I. (eds.). ACM Association for Computing Machinery, p. 646-659 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    Previous 1...3 4 5 6 7 8 Next

    ID: 209376262