Publications | Lund University Publications

31 – 35 of 35

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/publication?embed=1&q=keywords+exact+%22Proof+Complexity%22&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

« previous
1
2
3
4
next »

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
2008
Mark Towards an optimal separation of space and length in resolution
Nordström, Jakob ^LU and Håstad, Johan (2008) 40th Annual ACM Symposium on Theory of Computing, STOC 2008 In Proceedings of the Annual ACM Symposium on Theory of Computing p.701-710
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2006
Mark Narrow proofs may be spacious : Separating space and width in resolution
Nordström, Jakob ^LU (2006) 38th Annual ACM Symposium on Theory of Computing, STOC'06 In Proceedings of the Annual ACM Symposium on Theory of Computing 2006. p.507-516
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding

« previous
1
2
3
4
next »

your query:: Remove keywords: Proof Complexity