Jakob Nordström
Professor
- Published
On minimal unsatisfiability and time-space trade-offs for k-DNF resolution
Nordström, Jakob & Razborov, A., 2011, Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings. PART 1 ed. p. 642-653 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); No. PART 1, Vol. 6755 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
A generalized method for proving polynomial calculus degree lower bounds
Mikša, M. & Nordström, Jakob, 1 Jun 2015, 30th Conference on Computational Complexity, CCC 2015. Zuckerman, D. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 467-487 21 p. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 33).Research 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
- Published
Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
Mexi, G., Berthold, T., Gleixner, A. & Nordström, Jakob, 2023, 29th International Conference on Principles and Practice of Constraint Programming, CP 2023. Yap, R. H. C. Y. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 19 p. 27. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 280).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
Tight size-degree bounds for sums-of-squares proofs
Lauria, M. & Nordström, Jakob, 1 Jun 2015, 30th Conference on Computational Complexity, CCC 2015. Zuckerman, D. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 448-466 19 p. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 33).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
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
Tight Size-Degree Bounds for Sums-of-Squares Proofs
Lauria, M. & Nordström, Jakob, 1 Dec 2017, In: Computational Complexity. 26, 4, p. 911-948 38 p.Research output: Contribution to journal › Journal article › 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