Jakob Nordström
Professor
- 2012
On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity (Extended Abstract)
Huynh, T. & Nordström, Jakob, 1 May 2012, Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC '12). Association for Computing Machinery, Inc., p. 233-248 16 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
On the relative strength of pebbling and resolution
Nordström, Jakob, Apr 2012, In: ACM Transactions on Computational Logic. 13, 2, a16.Research output: Contribution to journal › Journal article › peer-review
Relating proof complexity measures and practical hardness of SAT
Järvisalo, M., Matsliah, A., Nordström, Jakob & Živný, S., 2012, Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Proceedings. p. 316-331 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 7514 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Space complexity in polynomial calculus
Filmus, Y., Lauria, M., Nordström, Jakob, Thapen, N. & Ron-Zewi, N., 2012, Proceedings - 2012 IEEE 27th Conference on Computational Complexity, CCC 2012. p. 334-344 11 p. 6243410. (Proceedings of the Annual IEEE Conference on Computational Complexity).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 2011
- 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
- 2010
- Published
Separations of Matroid Freeness Properties
Bhattacharyya, A., Grigorescu, E., Nordström, Jakob & Xie, N., 1 Aug 2010.Research output: Working paper › Research
- Published
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions
Ben-Sasson, E. & Nordström, Jakob, 1 Aug 2010.Research output: Working paper › Research
- Published
On the relative strength of pebbling and resolution
Nordström, Jakob, 2010, Proceedings - 25th Annual IEEE Conference on Computational Complexity, CCC 2010. p. 151-162 12 p. 5497889. (Proceedings of the Annual IEEE Conference on Computational Complexity).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 2009
- Published
A simplified way of proving trade-off results for resolution
Nordström, Jakob, 31 Aug 2009, In: Information Processing Letters. 109, 18, p. 1030-1035 6 p.Research output: Contribution to journal › Journal article › peer-review
- Published
A Space Hierarchy for $k$-DNF Resolution
Ben-Sasson, E. & Nordström, Jakob, 1 Apr 2009.Research output: Working paper › Research
ID: 209376262
Most downloads
-
66
downloads
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
31
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 -
23
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