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>
- 2016
-
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
Hardness of Approximation in PSPACE and Separation Results for Pebble Games
2015) 56th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2015 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2015-December. p.466-485(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A generalized method for proving polynomial calculus degree lower bounds
2015) 30th Conference on Computational Complexity, CCC 2015 In Leibniz International Proceedings in Informatics, LIPIcs 33. p.467-487(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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
-
Mark
Space complexity in polynomial calculus
(
- Contribution to journal › Article
- 2014
-
Mark
Long Proofs of (Seemingly) Simple Formulas
2014) 17th International Conference on Theory and Applications of Satisfiability Testing, SAT 2014, Held as Part of the Vienna Summer of Logic, VSL 2014 In Lecture Notes in Computer Science 8561. p.121-137(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A (biased) proof complexity survey for SAT practitioners
2014) 17th International Conference on Theory and Applications of Satisfiability Testing, SAT 2014, Held as Part of the Vienna Summer of Logic, VSL 2014 In Lecture Notes in Computer Science 8561. p.1-6(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding