Department of Computer Science

Jakob Nordström

Jakob Nordström

Professor

Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
- jn@di.ku.dk
- https://di.ku.dk/english/research/ac/
Mobile: +45+46707422198

Member of:

ORCID: 0000-0002-2700-4285

All
Research

Publication year:

All

1 - 1 out of 1Page size: 10

Sort by: Publication date

2017
Tight Size-Degree Bounds for Sums-of-Squares Proofs
Lauria, M. & Nordström, Jakob, 1 Dec 2017, In: Computational Complexity. 26, 4, p. 911-948 38 p.
Research output: Contribution to journal › Journal article › 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