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: Title
    1. 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

    2. Tight Size-Degree Bounds for Sums-of-Squares Proofs

      Lauria, M. & Nordström, Jakob, 1 Dec 2017, In: Computational Complexity. 26, 4, p. 911-948 38 p.

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

    3. Tight size-degree bounds for sums-of-squares proofs

      Lauria, M. & Nordström, Jakob, 1 Jun 2015, 30th Conference on Computational Complexity, CCC 2015. Zuckerman, D. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 448-466 19 p. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 33).

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

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

    5. Towards an understanding of polynomial calculus: New separations and lower bounds (extended abstract)

      Filmus, Y., Lauria, M., Mikša, M., Nordström, Jakob & Vinyals, M., 2013, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. PART 1 ed. p. 437-448 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); No. PART 1, Vol. 7965 LNCS).

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

    6. 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 für Informatik, p. 1-16 72. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 151).

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

    7. Trade-offs between time and memory in a tighter model of CDCL SAT solvers

      Elffers, J., Johannsen, J., Lauria, M., Magnard, T., Nordström, Jakob & Vinyals, M., 2016, Theory and Applications of Satisfiability Testing – SAT 2016 - 19th International Conference, Proceedings. Le Berre, D. & Creignou, N. (eds.). Springer Verlag, p. 160-176 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9710).

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

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

    9. Published

      Using Resolution Proofs to Analyse CDCL Solvers

      Kokkala, J. I. & Nordström, Jakob, 2020, Principles and Practice of Constraint Programming : 26th International Conference, CP 2020, Proceedings. Simonis, H. (ed.). Springer, p. 427-444 (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

    10. Using combinatorial benchmarks to probe the reasoning power of pseudo-boolean solvers

      Elffers, J., Giráldez-Cru, J., Nordström, Jakob & Vinyals, M., 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. 75-93 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

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

    ID: 209376262