Jakob Nordström
51 – 60 of 71
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 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
-
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
-
Mark
From small space to small width in resolution
2014) 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014 In Leibniz International Proceedings in Informatics, LIPIcs 25. p.300-311(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Narrow proofs may be maximally long
2014) 29th Annual IEEE Conference on Computational Complexity, CCC 2014 In Proceedings of the Annual IEEE Conference on Computational Complexity p.286-297(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2013
-
Mark
Towards an understanding of polynomial calculus : New separations and lower bounds (extended abstract)
2013) 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013 In Lecture Notes in Computer Science 7965(PART 1). p.437-448(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Some trade-off results for polynomial calculus
2013) 45th Annual ACM Symposium on Theory of Computing, STOC 2013 In Proceedings of the Annual ACM Symposium on Theory of Computing p.813-822(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Pebble games, proof complexity, and time-space trade-offs
(
- Contribution to journal › Article