Publications | Lund University Publications

11 – 20 of 36

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>

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
Mark Trade-offs between size and degree in polynomial calculus
Lagarde, Guillaume ; Nordström, Jakob ^LU ; Sokolov, Dmitry ^LU and Swernofsky, Joseph (2020) 11th Innovations in Theoretical Computer Science Conference, ITCS 2020 In Leibniz International Proceedings in Informatics, LIPIcs 151.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2019
Mark Nullstellensatz size-degree trade-offs from reversible pebbling
De Rezende, Susanna F. ^LU ; Nordström, Jakob ^LU ; Meir, Or and Robere, Robert (2019) 34th Computational Complexity Conference, CCC 2019 In Leibniz International Proceedings in Informatics, LIPIcs 137.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2018
Mark Clique is hard on average for regular resolution
Atserias, Albert ; Bonacina, Ilario ; De Rezende, Susanna F. ^LU ; Lauria, Massimo ; Nordström, Jakob ^LU and Razborov, Alexander (2018) 50th Annual ACM Symposium on Theory of Computing, STOC 2018 In Proceedings of the Annual ACM Symposium on Theory of Computing p.646-659
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2017
Mark Cumulative space in black-white pebbling and resolution
Alwen, Joël ; De Rezende, Susanna F. ^LU ; Nordström, Jakob ^LU and Vinyals, Marc (2017) 8th Innovations in Theoretical Computer Science Conference, ITCS 2017 In Leibniz International Proceedings in Informatics, LIPIcs 67.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Graph colouring is hard for algorithms based on hilbert's nullstellensatz and gröbner bases
Lauria, Massimo and Nordström, Jakob ^LU (2017) 32nd Computational Complexity Conference, CCC 2017 In Leibniz International Proceedings in Informatics, LIPIcs 79.
- 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 (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

your query:: Remove keywords: proof complexity