Publications | Lund University Publications

1 – 10 of 15

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+%22polynomial+calculus%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
2023
Mark Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
Conneryd, Jonas ^LU ; De Rezende, Susanna F. ^LU ; Nordstrom, Jakob ^LU ; Pang, Shuo and Risse, Kilian ^LU (2023) 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS p.1-11
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2021
Mark The power of negative reasoning
de Rezende, Susanna F. ^LU ; Lauria, Massimo ; Nordström, Jakob ^LU and Sokolov, Dmitry ^LU (2021) 36th Computational Complexity Conference, CCC 2021 In Leibniz International Proceedings in Informatics, LIPIcs 200.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2020
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
2017
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
2016
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 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

« previous
1
2
next »

your query:: Remove keywords: polynomial calculus