Publications | Lund University Publications

21 – 30 of 40

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>

2017
Mark Tight Size-Degree Bounds for Sums-of-Squares Proofs
Lauria, Massimo and Nordström, Jakob ^LU (2017) In Computational Complexity 26(4). p.911-948
- 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 How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity)
De Rezende, Susanna F. ^LU ; Nordstrom, Jakob ^LU and Vinyals, Marc (2016) 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016-December. p.295-304
- 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 A generalized method for proving polynomial calculus degree lower bounds
Mikša, Mladen and Nordström, Jakob ^LU (2015) 30th Conference on Computational Complexity, CCC 2015 In Leibniz International Proceedings in Informatics, LIPIcs 33. p.467-487
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Tight size-degree bounds for sums-of-squares proofs
Lauria, Massimo and Nordström, Jakob ^LU (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
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
Mark Space complexity in polynomial calculus
Filmus, Yuval ; Lauria, Massimo ; Nordström, Jakob ^LU ; Ron-Zewi, Noga and Thapen, Neil (2015) In SIAM Journal on Computing 44(4). p.1119-1153
- 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

your query:: Remove keywords: proof complexity