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>
- 2014
-
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
- 2012
-
Mark
Relating proof complexity measures and practical hardness of SAT
2012) 18th International Conference on Principles and Practice of Constraint Programming, CP 2012 In Lecture Notes in Computer Science 7514. p.316-331(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Space complexity in polynomial calculus
2012) IEEE Computer Society Technical Committee on Mathematical Foundations of Computing In Proceedings of the Annual IEEE Conference on Computational Complexity p.334-344(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
On the virtue of succinct proofs : Amplifying communication complexity hardness to time-space trade-offs in proof complexity
2012) 44th Annual ACM Symposium on Theory of Computing, STOC '12 In Proceedings of the Annual ACM Symposium on Theory of Computing p.233-247(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
On the relative strength of pebbling and resolution
(
- Contribution to journal › Article
- 2011
-
Mark
On minimal unsatisfiability and time-space trade-offs for k-DNF resolution
2011) 38th International Colloquium on Automata, Languages and Programming, ICALP 2011 In Lecture Notes in Computer Science 6755(PART 1). p.642-653(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding