Jakob Nordström

Jakob Nordström

Professor

Medlem af:

    ORCID: 0000-0002-2700-4285

    Udgivelsesår:
    Alle
    31 - 40 ud af 71Pr. side: 10
    Sortering: Udgivelsesår
    1. 2016

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

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

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

    5. 2017

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

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

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

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

    10. 2018

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

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

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

    Forrige 1 2 3 4 5 6 7 8 Næste

    ID: 209376262