Jakob Nordström
Professor
- 2021
- Published
Automating algebraic proof systems is NP-hard
De Rezende, S. F., Göös, M., Nordström, Jakob, Pitassi, T., Robere, R. & Sokolov, D., 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, Inc., p. 209-222Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Learn to Relax: Integrating 0-1 Integer Linear Programming with Pseudo-Boolean Conflict-Driven Search
Devriendt, J., Gleixner, A. & Nordström, Jakob, 2021, In: Constraints. 26, p. 26–55 30 p.Research output: Contribution to journal › Journal article › Research › peer-review
- Published
The Power of Negative Reasoning
de Rezende, S. F., Lauria, M., Nordström, Jakob & Sokolov, D., 2021, 36th Computational Complexity Conference, CCC 2021. Kabanets, V. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 24 p. 40. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 200).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 2020
- Published
Supercritical space-width trade-offs for resolution
Berkholz, C. & Nordström, Jakob, 2020, In: SIAM Journal on Computing. 49, 1, p. 98-118Research output: Contribution to journal › Journal article › Research › peer-review
- Published
A Cardinal Improvement to Pseudo-Boolean Solving
Elffers, J. & Nordström, Jakob, 1 Feb 2020, Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI '20). AAAI Press, p. 1495-1503 9 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Justifying All Differences Using Pseudo-Boolean Reasoning
Elffers, J., Gocht, S., McCreesh, C. & Nordström, Jakob, 1 Feb 2020, Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI '20). AAAI Press, p. 1486-1494 9 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
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. (ed.). Springer, p. 338-357 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12333 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
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, p. 1134-1140 7 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Using Resolution Proofs to Analyse CDCL Solvers
Kokkala, J. I. & Nordström, Jakob, 2020, Principles and Practice of Constraint Programming : 26th International Conference, CP 2020, Proceedings. Simonis, H. (ed.). Springer, p. 427-444 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12333 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Trade-offs between size and degree in polynomial calculus
Lagarde, G., Nordström, Jakob, Sokolov, D. & Swernofsky, J., Jan 2020, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020. Vidick, T. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-16 72. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 151).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
ID: 209376262
Most downloads
-
69
downloads
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
33
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 -
25
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