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

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

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

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

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

    5. Udgivet

      End-to-End Verification for Subgraph Solving

      Gocht, S., McCreesh, C., Myreen, M. O., Nordström, Jakob, Oertel, A. & Tan, Y. K., 2024, I: Proceedings of the AAAI Conference on Artificial Intelligence. 38, 8, s. 8038-8047 10 s.

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

    6. Udgivet

      An Auditable Constraint Programming Solver

      Gocht, S., McCreesh, C. & Nordström, Jakob, 2022, 28th International Conference on Principles and Practice of Constraint Programming, CP 2022. Solnon, C. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 25. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 235).

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

    7. Udgivet

      Certified CNF Translations for Pseudo-Boolean Solving

      Gocht, S., Martins, R., Nordström, Jakob & Oertel, A., 2022, 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022. Meel, K. S. & Strichman, O. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 236).

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

    8. On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity (Extended Abstract)

      Huynh, T. & Nordström, Jakob, 1 maj 2012, Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC '12). Association for Computing Machinery, Inc., s. 233-248 16 s.

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

    9. Relating proof complexity measures and practical hardness of SAT

      Järvisalo, M., Matsliah, A., Nordström, Jakob & Živný, S., 2012, Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Proceedings. s. 316-331 16 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 7514 LNCS).

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

    10. Udgivet

      Adding Dual Variables to Algebraic Reasoning for Gate-Level Multiplier Verification

      Kaufmann, D., Beame, P., Biere, A. & Nordström, Jakob, 2022, Proceedings of the 2022 Design, Automation and Test in Europe Conference and Exhibition, DATE 2022. Bolchini, C., Verbauwhede, I. & Vatajelu, I. (red.). IEEE, s. 1431-1436 6 s.

      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