Jakob Nordström
Professor
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
- 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
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
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
Long Proofs of (Seemingly) Simple Formulas
Mikša, M. & Nordström, Jakob, 2014, Theory and Applications of Satisfiability Testing, SAT 2014 - 17th International Conference, Held as Part of theVienna Summer of Logic, VSL 2014, Proceedings. Springer Verlag, p. 121-137 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 8561 LNCS).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 › Research › peer-review
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
- Published
Narrow proofs may be spacious: Separating space and width in resolution
Nordström, Jakob, 2009, In: SIAM Journal on Computing. 39, 1, p. 59-121 63 p.Research output: Contribution to journal › Journal article › Research › peer-review
- Published
Narrow proofs may be spacious: Separating space and width in resolution
Nordström, Jakob, 2006, STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. p. 507-516 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing, Vol. 2006).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