Jakob Nordström
Professor
ORCID: 0000-0002-2700-4285
1 - 1 out of 1Page size: 10
- 2020
- Published
Automating Algebraic Proof Systems is NP-Hard
de Rezende, S. F., Göös, M., Nordström, Jakob, Pitassi, T., Robere, R. & Sokolov, D., 1 May 2020, Electronic Colloquium on Computational Complexity, 34 p.Research output: Working paper › 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