Jakob Nordström

Jakob Nordström

Professor

Medlem af:

    ORCID: 0000-0002-2700-4285

    Udgivelsesår:
    Alle
    26 - 50 ud af 71Pr. side: 25
    Sortering: Udgivelsesdato
    1. 2015

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

    3. On the Interplay Between Proof Complexity and SAT Solving

      Nordström, Jakob, 1 jul. 2015, I: ACM SIGLOG News. 2, 3, s. 19-44 26 s.

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

    4. From small space to small width in resolution

      Filmus, Y., Lauria, M., Mikša, M., Nordström, Jakob & Vinyals, M., 1 aug. 2015, I: ACM Transactions on Computational Logic. 16, 4, 28.

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

    5. Hardness of Approximation in PSPACE and Separation Results for Pebble Games (Extended Abstract)

      Chan, S. M., Lauria, M., Nordström, Jakob & Vinyals, M., 1 okt. 2015, Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'15). IEEE, s. 466-485 20 s.

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

    6. 2016

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

    8. Narrow proofs may be maximally long

      Atserias, A., Lauria, M. & Nordström, Jakob, feb. 2016, I: ACM Transactions on Computational Logic. 17, 3, 19.

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

    9. Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler - Leman Refinement Steps

      Berkholz, C. & Nordström, Jakob, 5 jul. 2016, Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science, LICS 2016. Institute of Electrical and Electronics Engineers Inc., s. 267-276 10 s. (Proceedings - Symposium on Logic in Computer Science, Bind 05-08-July-2016).

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

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

    11. 2017

    12. CNFgen: A generator of crafted benchmarks

      Lauria, M., Elffers, J., Nordström, Jakob & Vinyals, M., 2017, Theory and Applications of Satisfiability Testing – SAT 2017 - 20th International Conference, Proceedings. Gaspers, S. & Walsh, T. (red.). Springer Verlag, s. 464-473 10 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 10491 LNCS).

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

    13. Graph colouring is hard for algorithms based on hilbert's nullstellensatz and gröbner bases

      Lauria, M. & Nordström, Jakob, 1 jul. 2017, 32nd Computational Complexity Conference, CCC 2017. O'Donnell, R. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 79).

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

    14. Cumulative space in black-white pebbling and resolution

      Alwen, J., De Rezende, S. F., Nordström, Jakob & Vinyals, M., 1 nov. 2017, 8th Innovations in Theoretical Computer Science Conference, ITCS 2017. Papadimitriou, C. H. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs, Bind 67).

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

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

    16. 2018

    17. Divide and conquer: Towards faster pseudo-boolean solving

      Elffers, J. & Nordström, Jakob, 2018, Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. Lang, J. (red.). International Joint Conferences on Artificial Intelligence, s. 1291-1299 9 s. (IJCAI International Joint Conference on Artificial Intelligence, Bind 2018-July).

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

    18. 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. (red.). Springer Verlag, s. 292-310 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

    19. Seeking practical CDCL insights from theoretical SAT benchmarks

      Elffers, J., Cru, J. G., Gocht, S., Nordström, Jakob & Simon, L., 2018, Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. Lang, J. (red.). International Joint Conferences on Artificial Intelligence, s. 1300-1308 9 s. (IJCAI International Joint Conference on Artificial Intelligence, Bind 2018-July).

      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. 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. (red.). ACM Association for Computing Machinery, s. 646-659 14 s. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    22. 2019
    23. Udgivet

      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, Bind 137. s. 1-16 18. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 137).

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

    24. Udgivet

      On division versus saturation in pseudo-boolean solving

      Gocht, S., Nordström, Jakob & Yehudayoff, A., 2019, Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019. Kraus, S. (red.). International Joint Conferences on Artificial Intelligence, s. 1711-1718

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

    25. 2020
    26. Udgivet

      Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems

      Gocht, S., McBride, R., McCreesh, C., Nordström, Jakob, Prosser, P. & Trimble, J., 2020, Principles and Practice of Constraint Programming: 26th International Conference, CP 2020, Proceedings. Simonis, H. (red.). Springer, s. 338-357 (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

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

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

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

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

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

    Forrige 1 2 3 Næste

    ID: 209376262