Jakob Nordström

Professor
Fler filtreringsmöjligheter
  1. 2021
  2. Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search

    Jo Devriendt, Ambros Gleixner & Jakob Nordström, 2021 jan 18, I: Constraints.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  3. Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

    Susanna F. De Rezende, Or Meir, Jakob Nordström & Robert Robere, 2021, I: Computational Complexity. 30, 1, 4.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  4. 2020
  5. Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs

    Susanna F. de Rezende, Jakob Nordström, Kilian Risse & Dmitry Sokolov, 2020 jul 1, CCC '20: Proceedings of the 35th Computational Complexity Conference 2020. Saraf, S. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 28. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 169).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  6. Trade-offs between size and degree in polynomial calculus

    Guillaume Lagarde, Jakob Nordström, Dmitry Sokolov & Joseph Swernofsky, 2020 jan, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020. Vidick, T. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 72. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 151).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

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

    Stephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordström, Patrick Prosser & James Trimble, 2020, Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Proceedings. Simonis, H. (red.). Springer, s. 338-357 20 s. (Lecture Notes in Computer Science; vol. 12333).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  8. Simplified and Improved Separations Between Regular and General Resolution by Lifting

    Marc Vinyals, Jan Elffers, Jan Johannsen & Jakob Nordström, 2020, Theory and Applications of Satisfiability Testing – SAT 2020: 23rd International Conference, Proceedings. Pulina, L. & Seidl, M. (red.). Springer, s. 182-200 19 s. (Lecture Notes in Computer Science; vol. 12178).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  9. Supercritical space-width trade-offs for resolution

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  10. Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models

    Buser Say, Jo Devriendt, Jakob Nordström & Peter J. Stuckey, 2020, Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Proceedings. Simonis, H. (red.). Springer, s. 917-934 18 s. (Lecture Notes in Computer Science; vol. 12333).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  11. Using Resolution Proofs to Analyse CDCL Solvers

    Janne I. Kokkala & Jakob Nordström, 2020, Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Proceedings. Simonis, H. (red.). Springer, s. 427-444 18 s. (Lecture Notes in Computer Science; vol. 12333).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  12. Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning

    Vincent Liew, Paul Beame, Jo Devriendt, Jan Elffers & Jakob Nordstrom, 2020, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, FMCAD 2020. Ivrii, A., Strichman, O., Hunt, W. A. & Weissenbacher, G. (red.). Institute of Electrical and Electronics Engineers Inc., s. 194-204 11 s. 9283622. (Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, FMCAD 2020).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  13. 2019
  14. Nullstellensatz size-degree trade-offs from reversible pebbling

    Susanna F. De Rezende, Jakob Nordström, Or Meir & Robert Robere, 2019 jul 1, 34th Computational Complexity Conference, CCC 2019. Shpilka, A. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 137).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  15. On division versus saturation in pseudo-boolean solving

    Stephan Gocht, Jakob Nordström & Amir Yehudayoff, 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 8 s. (IJCAI International Joint Conference on Artificial Intelligence; vol. 2019-August).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  16. 2018
  17. Clique is hard on average for regular resolution

    Albert Atserias, Ilario Bonacina, Susanna F. De Rezende, Massimo Lauria, Jakob Nordström & Alexander Razborov, 2018 jun 20, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Henzinger, M., Kempe, D. & Diakonikolas, I. (red.). Association for Computing Machinery (ACM), s. 646-659 14 s. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

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

    Jan Elffers & Jakob Nordström, 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; vol. 2018-July).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  19. In between resolution and cutting planes: A study of proof systems for pseudo-boolean SAT solving

    Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht & Jakob Nordströ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, s. 292-310 19 s. (Lecture Notes in Computer Science; vol. 10929).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  20. Seeking practical CDCL insights from theoretical SAT benchmarks

    Jan Elffers, Jesús Giráldez Cru, Stephan Gocht, Jakob Nordström & Laurent Simon, 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; vol. 2018-July).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

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

    Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström & Marc Vinyals, 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, s. 75-93 19 s. (Lecture Notes in Computer Science; vol. 10929).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  22. 2017
  23. Tight Size-Degree Bounds for Sums-of-Squares Proofs

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  24. Cumulative space in black-white pebbling and resolution

    Joël Alwen, Susanna F. De Rezende, Jakob Nordström & Marc Vinyals, 2017 nov 1, 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; vol. 67).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

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

    Massimo Lauria & Jakob Nordström, 2017 jul 1, 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; vol. 79).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  26. CNFgen: A generator of crafted benchmarks

    Massimo Lauria, Jan Elffers, Jakob Nordström & Marc Vinyals, 2017, Theory and Applications of Satisfiability Testing – SAT 2017: 20th International Conference, Proceedings. Gaspers, S. & Walsh, T. (red.). Springer, s. 464-473 10 s. (Lecture Notes in Computer Science; vol. 10491).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  27. 2016
  28. How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity)

    Susanna F. De Rezende, Jakob Nordstrom & Marc Vinyals, 2016 dec 14, Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016. IEEE - Institute of Electrical and Electronics Engineers Inc., s. 295-304 10 s. 7782943. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2016-December).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  29. Supercritical space-width trade-offs for resolution

    Christoph Berkholz & Jakob Nordström, 2016 aug 1, 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; vol. 55).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

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

    Christoph Berkholz & Jakob Nordström, 2016 jul 5, Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science, LICS 2016. Association for Computing Machinery (ACM), s. 267-276 10 s. (Proceedings - Symposium on Logic in Computer Science; vol. 05-08-July-2016).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  31. Narrow proofs may be maximally long

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

Föregående 1 2 Nästa