Jakob Nordström

Jakob Nordström

Professor

Member of:

    ORCID: 0000-0002-2700-4285

    Publication year:
    All
    26 - 50 out of 71Page size: 25
    1. 2020
    2. Published

      Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs

      de Rezende, S. F., Nordström, Jakob, Risse, K. & Sokolov, D., 1 Jul 2020, 35th Computational Complexity Conference, CCC 2020. Saraf, S. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-24 28. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 169).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    3. Published

      Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity

      de Rezende, S. F., Meir, O., Nordström, Jakob, Pitassi, T., Robere, R. & Vinyals, M., 1 Nov 2020, Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS '20). IEEE, p. 24-30

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    4. 2019
    5. Published

      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. (ed.). International Joint Conferences on Artificial Intelligence, p. 1711-1718

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    6. Published

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

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    7. 2018

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

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    9. 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. (ed.). International Joint Conferences on Artificial Intelligence, p. 1291-1299 9 p. (IJCAI International Joint Conference on Artificial Intelligence, Vol. 2018-July).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    10. 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. (ed.). International Joint Conferences on Artificial Intelligence, p. 1300-1308 9 p. (IJCAI International Joint Conference on Artificial Intelligence, Vol. 2018-July).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    11. 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. (eds.). Springer Verlag, p. 75-93 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 10929 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    12. 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. (eds.). Springer Verlag, p. 292-310 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 10929 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    13. 2017

    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. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 67).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    15. 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. (eds.). Springer Verlag, p. 464-473 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 10491 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    16. 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. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 79).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

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

      Lauria, M. & Nordström, Jakob, 1 Dec 2017, In: Computational Complexity. 26, 4, p. 911-948 38 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    18. 2016

    19. Narrow proofs may be maximally long

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

      Research output: Contribution to journal › Journal article › Research › peer-review

    20. 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., p. 267-276 10 p. (Proceedings - Symposium on Logic in Computer Science, Vol. 05-08-July-2016).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

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

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

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

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    23. 2015

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

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

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    25. From small space to small width in resolution

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

      Research output: Contribution to journal › Journal article › Research › peer-review

    26. Space complexity in polynomial calculus

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

      Research output: Contribution to journal › Journal article › Research › peer-review

    27. 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. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 448-466 19 p. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 33).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    28. A generalized method for proving polynomial calculus degree lower bounds

      Mikša, M. & Nordström, Jakob, 1 Jun 2015, 30th Conference on Computational Complexity, CCC 2015. Zuckerman, D. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 467-487 21 p. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 33).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    29. On the Interplay Between Proof Complexity and SAT Solving

      Nordström, Jakob, 1 Jul 2015, In: ACM SIGLOG News. 2, 3, p. 19-44 26 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    30. 2014

    31. Narrow proofs may be maximally long

      Atserias, A., Lauria, M. & Nordström, Jakob, 2014, Proceedings - IEEE 29th Conference on Computational Complexity, CCC 2014. IEEE Computer Society Press, p. 286-297 12 p. 6875497. (Proceedings of the Annual IEEE Conference on Computational Complexity).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    32. From small space to small width in resolution

      Filmus, Y., Lauria, M., Mikša, M., Nordström, Jakob & Vinyals, M., 1 Mar 2014, 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014. Portier, N. & Mayr, E. W. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 25. p. 300-311 12 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    Previous 1 2 3 Next

    ID: 209376262