Jakob Nordström
Professor
A (biased) proof complexity survey for SAT practitioners
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. 1-6 6 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
From small space to small width in resolution
Filmus, Y., Lauria, M., Mikša, M., Nordström, Jakob & Vinyals, M., 1 Mar 2014, 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014. Portier, N. & Mayr, E. W. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 25. p. 300-311 12 p.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
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
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