Jakob Nordström
Professor
ORCID: 0000-0002-2700-4285
1 - 3 out of 3Page size: 500
- 2010
- 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
- Published
Separations of Matroid Freeness Properties
Bhattacharyya, A., Grigorescu, E., Nordström, Jakob & Xie, N., 1 Aug 2010.Research output: Working paper
- 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
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