Jakob Nordström

61 – 70 of 73

show: 10
|
sort: year (new to old)

News feed Embed this list Save this search Mark all Export

Cancel

Embed this list

copy and paste the html snippet below into your own page:

<iframe src="https://lup.lub.lu.se/search/person/984829bd-2059-42df-abef-4bba2bcd74ed?embed=1&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

« previous
1
2
…
5
6
7
8
next »

2013
Mark Some trade-off results for polynomial calculus
Beck, Chris ; Nordström, Jakob ^LU and Tang, Bangsheng (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
Nordström, Jakob ^LU (2013) In Logical Methods in Computer Science 9(3).
- Contribution to journal › Article
2012
Mark Relating proof complexity measures and practical hardness of SAT
Järvisalo, Matti ; Matsliah, Arie ; Nordström, Jakob ^LU and Živný, Stanislav (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
Filmus, Yuval ; Lauria, Massimo ; Nordström, Jakob ^LU ; Thapen, Neil and Ron-Zewi, Noga (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
Huynh, Trinh and Nordstrom, Jakob ^LU (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
Nordström, Jakob ^LU (2012) In ACM Transactions on Computational Logic 13(2).
- Contribution to journal › Article
2011
Mark On minimal unsatisfiability and time-space trade-offs for k-DNF resolution
Nordström, Jakob ^LU and Razborov, Alexander (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
2010
Mark On the relative strength of pebbling and resolution
Nordström, Jakob ^LU (2010) 25th Annual IEEE Conference on Computational Complexity, CCC 2010 In Proceedings of the Annual IEEE Conference on Computational Complexity p.151-162
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2009
Mark A simplified way of proving trade-off results for resolution
Nordström, Jakob ^LU (2009) In Information Processing Letters 109(18). p.1030-1035
- Contribution to journal › Article
Mark Narrow proofs may be spacious : Separating space and width in resolution
Nordström, Jakob ^LU (2009) In SIAM Journal on Computing 39(1). p.59-121
- Contribution to journal › Article

« previous
1
2
…
5
6
7
8
next »