Jakob Nordström
Professor
- 2017
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
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
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
- 2016
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
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
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 › peer-review
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
- 2015
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
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 › peer-review
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 › peer-review
ID: 209376262
Most downloads
-
66
downloads
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
31
downloads
Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
23
downloads
Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published