Jakob Nordström
Professor
- 2014
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
- 2013
Pebble games, proof complexity, and time-space trade-offs
Nordström, Jakob, 13 Sep 2013, In: Logical Methods in Computer Science. 9, 3, 15.Research output: Contribution to journal › Journal article › Research › peer-review
Some trade-off results for polynomial calculus
Beck, C., Nordström, Jakob & Tang, B., 2013, STOC 2013 - Proceedings of the 2013 ACM Symposium on Theory of Computing. p. 813-822 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Towards an understanding of polynomial calculus: New separations and lower bounds (extended abstract)
Filmus, Y., Lauria, M., Mikša, M., Nordström, Jakob & Vinyals, M., 2013, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. PART 1 ed. p. 437-448 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); No. PART 1, Vol. 7965 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 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 › Research › 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 › Research › peer-review
- Published
A Space Hierarchy for $k$-DNF Resolution
Ben-Sasson, E. & Nordström, Jakob, 1 Apr 2009.Research output: Working paper › Research
- 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
- 2008
- Published
Short Proofs May Be Spacious: Understanding Space in Resolution
Nordström, Jakob, 1 May 2008Research output: Book/Report › Report › Research › peer-review
- Published
Short proofs may be spacious: An optimal separation of space and length in resolution
Ben-Sasson, E. & Nordström, Jakob, 2008, Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. p. 709-718 10 p. 4691003. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Towards an optimal separation of space and length in resolution
Nordström, Jakob & Håstad, J., 2008, STOC'08: Proceedings of the 2008 ACM Symposium on Theory of Computing. Association for Computing Machinery (ACM), p. 701-710 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 2006
- 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
- 2001
- Published
Stålmarck's Method Versus Resolution: a Comparative Theoretical Study
Nordström, Jakob, 2001Research output: Book/Report › Report › Research
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