Jakob Nordström

Jakob Nordström

Professor

Medlem af:

    ORCID: 0000-0002-2700-4285

    Udgivelsesår:
    Alle
    51 - 71 ud af 71Pr. side: 25
    Sortering: Titel
    1. Udgivet

      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. s. 709-718 10 s. 4691003. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    2. Udgivet

      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. (red.). Springer, s. 182-200 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 12178 LNCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    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. s. 813-822 10 s. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    4. Space complexity in polynomial calculus

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

      Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

    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. s. 334-344 11 s. 6243410. (Proceedings of the Annual IEEE Conference on Computational Complexity).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    6. Udgivet

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

      Nordström, Jakob, 2001

      Publikation: Bog/antologi/afhandling/rapport › Rapport › Forskning

    7. Udgivet

      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, s. 1134-1140 7 s.

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    8. Udgivet

      Supercritical space-width trade-offs for resolution

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

      Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

    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. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 57. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 55).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    10. Udgivet

      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. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 24 s. 40. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 200).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    11. Udgivet

      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. (red.). Springer, s. 917-934 18 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 12333 LNCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

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

      Lauria, M. & Nordström, Jakob, 1 dec. 2017, I: Computational Complexity. 26, 4, s. 911-948 38 s.

      Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

    13. 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. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, s. 448-466 19 s. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 33).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    14. Udgivet

      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), s. 701-710 10 s. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    15. 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 udg. s. 437-448 12 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Nr. PART 1, Bind 7965 LNCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    16. Udgivet

      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. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, s. 1-16 72. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 151).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    17. 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. (red.). Springer Verlag, s. 160-176 17 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 9710).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    18. Udgivet

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

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

      Publikation: Working paper › Forskning

    19. Udgivet

      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. (red.). Springer, s. 427-444 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 12333 LNCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    20. 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. (red.). Springer Verlag, s. 75-93 19 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 10929 LNCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    21. Udgivet

      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). IEEE, s. 194-204 9283622,

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    Forrige 1 2 3 Næste

    ID: 209376262