Jakob Nordström
Professor
ORCID: 0000-0002-2700-4285
1 - 2 out of 2Page size: 10
- 2021
- Published
Automating algebraic proof systems is NP-hard
De Rezende, S. F., Göös, M., Nordström, Jakob, Pitassi, T., Robere, R. & Sokolov, D., 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, Inc., p. 209-222Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
The Power of Negative Reasoning
de Rezende, S. F., Lauria, M., Nordström, Jakob & Sokolov, D., 2021, 36th Computational Complexity Conference, CCC 2021. Kabanets, V. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 24 p. 40. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 200).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