Jakob Nordström

Jakob Nordström

Professor

Member of:


    1. 2001
    2. Published
    3. 2006
    4. 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 proceedingArticle in proceedingsResearchpeer-review

    5. 2008
    6. 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 proceedingArticle in proceedingsResearchpeer-review

    7. 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 proceedingArticle in proceedingsResearchpeer-review

    8. Published

      Short Proofs May Be Spacious: Understanding Space in Resolution

      Nordström, Jakob, 1 May 2008

      Research output: Book/ReportReportpeer-review

    9. 2009
    10. 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 journalJournal articlepeer-review

    11. Published

      A Space Hierarchy for $k$-DNF Resolution

      Ben-Sasson, E. & Nordström, Jakob, 1 Apr 2009.

      Research output: Working paperResearch

    12. 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 journalJournal articlepeer-review

    13. 2010
    14. 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 proceedingArticle in proceedingsResearchpeer-review

    15. Published

      Separations of Matroid Freeness Properties

      Bhattacharyya, A., Grigorescu, E., Nordström, Jakob & Xie, N., 1 Aug 2010.

      Research output: Working paperResearch

    Previous 1 2 3 4 5 6 7 Next

    ID: 209376262