Jakob Nordström
Professor
- 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
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
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
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
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
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
Simplified and Improved Separations Between Regular and General Resolution by Lifting
Vinyals, M., Elffers, J., Johannsen, J. & Nordström, Jakob, 2020, Theory and Applications of Satisfiability Testing – SAT 2020 - 23rd International Conference, Proceedings. Pulina, L. & Seidl, M. (eds.). Springer, p. 182-200 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12178 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
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
Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models
Say, B., Devriendt, J., Nordström, Jakob & Stuckey, P. J., 2020, Principles and Practice of Constraint Programming: 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings. Simonis, H. (ed.). Springer, p. 917-934 18 p. (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
- 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
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
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