Publications | Lund University Publications

1 – 10 of 11

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+%22Width%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
next »

2024
Mark A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds
Mikša, Mladen and Nordström, Jakob ^LU (2024) In Journal of the ACM 71(6).
- Contribution to journal › Article
2020
Mark Supercritical space-width trade-offs for resolution
Berkholz, Christoph and Nordström, Jakob ^LU (2020) In SIAM Journal on Computing 49(1). p.98-118
- Contribution to journal › Article
2016
Mark Supercritical space-width trade-offs for resolution
Berkholz, Christoph and Nordström, Jakob ^LU (2016) 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 In Leibniz International Proceedings in Informatics, LIPIcs 55.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Narrow proofs may be maximally long
Atserias, Albert ; Lauria, Massimo and Nordström, Jakob ^LU (2016) In ACM Transactions on Computational Logic 17(3).
- Contribution to journal › Article
2015
Mark From small space to small width in resolution
Filmus, Yuval ; Lauria, Massimo ; Mikša, Mladen ; Nordström, Jakob ^LU and Vinyals, Marc (2015) In ACM Transactions on Computational Logic 16(4).
- Contribution to journal › Article
2014
Mark From small space to small width in resolution
Filmus, Yuval ; Lauria, Massimo ; Mikša, Mladen ; Nordström, Jakob ^LU and Vinyals, Marc (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
Atserias, Albert ; Lauria, Massimo and Nordström, Jakob ^LU (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 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
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
next »

your query:: Remove keywords: Width