Jakob Nordström
Professor
- 2021
- 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
Proof Complexity and SAT Solving
Buss, S. & Nordström, Jakob, 2021, Handbook of Satisfiability. Biere, A., Heule, M. J. H., van Maaren, H. & Walsh, T. (eds.). 2 ed. IMIA and IOS Press, p. 233 - 350 (Frontiers in Artificial Intelligence and Applications, Vol. 336).Research output: Chapter in Book/Report/Conference proceeding › Book chapter › 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
KRW Composition Theorems via Lifting
de Rezende, S., Meir, O., Nordström, Jakob, Pitassi, T. & Robere, R., 1 Nov 2020, Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS '20). IEEE, p. 4149Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 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-30Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning
Liew, V., Beame, P., Devriendt, J., Elffers, J. & Nordström, Jakob, 1 Sep 2020, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design (FMCAD '20). IEEE, p. 194-204 9283622,Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 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
- 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
Automating Algebraic Proof Systems is NP-Hard
de Rezende, S. F., Göös, M., Nordström, Jakob, Pitassi, T., Robere, R. & Sokolov, D., 1 May 2020, Electronic Colloquium on Computational Complexity, 34 p.Research output: Working paper › Research
- 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
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