Jakob Nordström
41 – 50 of 71
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2017
-
Mark
Graph colouring is hard for algorithms based on hilbert's nullstellensatz and gröbner bases
2017) 32nd Computational Complexity Conference, CCC 2017 In Leibniz International Proceedings in Informatics, LIPIcs 79.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Tight Size-Degree Bounds for Sums-of-Squares Proofs
(
- Contribution to journal › Article
-
Mark
CNFgen : A generator of crafted benchmarks
2017) 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017 In Lecture Notes in Computer Science 10491. p.464-473(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2016
-
Mark
Supercritical space-width trade-offs for resolution
2016) 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 In Leibniz International Proceedings in Informatics, LIPIcs 55.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity)
2016) 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016-December. p.295-304(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler - Leman Refinement Steps
2016) 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2016 In Proceedings - Symposium on Logic in Computer Science 05-08-July-2016. p.267-276(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Trade-offs between time and memory in a tighter model of CDCL SAT solvers
2016) 19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016 In Lecture Notes in Computer Science 9710. p.160-176(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Narrow proofs may be maximally long
(
- Contribution to journal › Article
- 2015
-
Mark
Tight size-degree bounds for sums-of-squares proofs
2015) 30th Conference on Computational Complexity, CCC 2015 In Leibniz International Proceedings in Informatics, LIPIcs 33. p.448-466(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
From small space to small width in resolution
(
- Contribution to journal › Article