Jakob Nordström
31 – 40 of 72
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2020
-
Mark
Simplified and Improved Separations Between Regular and General Resolution by Lifting
(2020) 23rd International Conference on Theory and Applications of Satisfiability Testing, SAT 2020 In Lecture Notes in Computer Science 12178. p.182-200
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Supercritical space-width trade-offs for resolution
- Contribution to journal › Article
-
Mark
Trade-offs between size and degree in polynomial calculus
(2020) 11th Innovations in Theoretical Computer Science Conference, ITCS 2020 In Leibniz International Proceedings in Informatics, LIPIcs 151.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2019
-
Mark
On division versus saturation in pseudo-boolean solving
(2019) 28th International Joint Conference on Artificial Intelligence, IJCAI 2019 In IJCAI International Joint Conference on Artificial Intelligence 2019-August. p.1711-1718
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Nullstellensatz size-degree trade-offs from reversible pebbling
De Rezende, Susanna F. LU
; Nordström, Jakob
LU
; Meir, Or
and Robere, Robert
(2019)
34th Computational Complexity Conference, CCC 2019
In Leibniz International Proceedings in Informatics, LIPIcs
137.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2018
-
Mark
Seeking practical CDCL insights from theoretical SAT benchmarks
(2018) 27th International Joint Conference on Artificial Intelligence, IJCAI 2018 In IJCAI International Joint Conference on Artificial Intelligence 2018-July. p.1300-1308
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Divide and conquer : Towards faster pseudo-boolean solving
(2018) 27th International Joint Conference on Artificial Intelligence, IJCAI 2018 In IJCAI International Joint Conference on Artificial Intelligence 2018-July. p.1291-1299
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
In between resolution and cutting planes : A study of proof systems for pseudo-boolean SAT solving
(2018) 21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018 Held as Part of the Federated Logic Conference, FloC 2018 In Lecture Notes in Computer Science 10929. p.292-310
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Using combinatorial benchmarks to probe the reasoning power of pseudo-boolean solvers
(2018) 21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018 Held as Part of the Federated Logic Conference, FloC 2018 In Lecture Notes in Computer Science 10929. p.75-93
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Clique is hard on average for regular resolution
Atserias, Albert ; Bonacina, Ilario ; De Rezende, Susanna F. LU
; Lauria, Massimo
; Nordström, Jakob
LU
and Razborov, Alexander
(2018)
50th Annual ACM Symposium on Theory of Computing, STOC 2018
In Proceedings of the Annual ACM Symposium on Theory of Computing
p.646-659
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding