Jakob Nordström

Jakob Nordström

Professor

Member of:

    ORCID: 0000-0002-2700-4285

    Publication year:
    All
    51 - 71 out of 71Page size: 50
    Sort by: 1st author

    1. A (biased) proof complexity survey for SAT practitioners

      Nordström, Jakob, 2014, Theory and Applications of Satisfiability Testing, SAT 2014 - 17th International Conference, Held as Part of theVienna Summer of Logic, VSL 2014, Proceedings. Springer Verlag, p. 1-6 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 8561 LNCS).

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

    2. Published

      Towards an optimal separation of space and length in resolution

      Nordström, Jakob & Håstad, J., 2008, STOC'08: Proceedings of the 2008 ACM Symposium on Theory of Computing. Association for Computing Machinery (ACM), p. 701-710 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

    3. On the relative strength of pebbling and resolution

      Nordström, Jakob, Apr 2012, In: ACM Transactions on Computational Logic. 13, 2, a16.

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

    4. Published

      Short Proofs May Be Spacious: Understanding Space in Resolution

      Nordström, Jakob, 1 May 2008

      Research output: Book/Report › Report › Research › peer-review

    5. Published

      A simplified way of proving trade-off results for resolution

      Nordström, Jakob, 31 Aug 2009, In: Information Processing Letters. 109, 18, p. 1030-1035 6 p.

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

    6. Published

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

      Nordström, Jakob, 2001

      Research output: Book/Report › Report › Research

    7. Published

      On the relative strength of pebbling and resolution

      Nordström, Jakob, 2010, Proceedings - 25th Annual IEEE Conference on Computational Complexity, CCC 2010. p. 151-162 12 p. 5497889. (Proceedings of the Annual IEEE Conference on Computational Complexity).

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

    8. Published

      Narrow proofs may be spacious: Separating space and width in resolution

      Nordström, Jakob, 2009, In: SIAM Journal on Computing. 39, 1, p. 59-121 63 p.

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

    9. On the Interplay Between Proof Complexity and SAT Solving

      Nordström, Jakob, 1 Jul 2015, In: ACM SIGLOG News. 2, 3, p. 19-44 26 p.

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

    10. Published

      Narrow proofs may be spacious: Separating space and width in resolution

      Nordström, Jakob, 2006, STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. p. 507-516 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing, Vol. 2006).

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

    11. Pebble games, proof complexity, and time-space trade-offs

      Nordström, Jakob, 13 Sep 2013, In: Logical Methods in Computer Science. 9, 3, 15.

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

    12. Published

      On minimal unsatisfiability and time-space trade-offs for k-DNF resolution

      Nordström, Jakob & Razborov, A., 2011, Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings. PART 1 ed. p. 642-653 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); No. PART 1, Vol. 6755 LNCS).

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

    13. Published

      Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models

      Say, B., Devriendt, J., Nordström, Jakob & Stuckey, P. J., 2020, Principles and Practice of Constraint Programming: 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings. Simonis, H. (ed.). Springer, p. 917-934 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12333 LNCS).

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

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

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

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

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

    18. 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 für Informatik, p. 1-24 28. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 169).

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

    19. Published

      Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

      de Rezende, S. F., Nordström, Jakob, Meir, O. & Robere, R., 2019, 34th Computational Complexity Conference (CCC 2019), Proceedings. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Vol. 137. p. 1-16 18. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 137).

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

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

    21. 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, Electronic Colloquium on Computational Complexity, 34 p.

      Research output: Working paper › Research

    Previous 1 2 Next

    ID: 209376262