Publications | Lund University Publications

1 – 8 of 8

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+%22Cutting+planes%22&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

2025
Mark Lifting with colourful sunflowers
de Rezende, Susanna F. ^LU and Vinyals, Marc (2025) 40th Computational Complexity Conference, CCC 2025 In LIPIcs : Leibniz international proceedings in informatics 339.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler–Leman
De Rezende, Susanna F. ^LU ; Fleming, Noah ^LU ; Janett, Duri Andrea ; Nordström, Jakob ^LU and Pang, Shuo (2025) 57th Annual ACM Symposium on Theory of Computing, STOC 2025 In Proceedings of the Annual ACM Symposium on Theory of Computing p.1371-1382
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2020
Mark Lifting with simple gadgets and applications to circuit and proof complexity
De Rezende, Susanna ^LU ; Meir, Or ; Nordstrom, Jakob ^LU ; Pitassi, Toniann ; Robere, Robert and Vinyals, Marc (2020) 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2020-November. p.24-30
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning
Liew, Vincent ; Beame, Paul ; Devriendt, Jo ^LU ; Elffers, Jan ^LU and Nordstrom, Jakob ^LU (2020) 20th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2020 In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, FMCAD 2020 p.194-204
- 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 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
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
2012
Mark On the virtue of succinct proofs : Amplifying communication complexity hardness to time-space trade-offs in proof complexity
Huynh, Trinh and Nordstrom, Jakob ^LU (2012) 44th Annual ACM Symposium on Theory of Computing, STOC '12 In Proceedings of the Annual ACM Symposium on Theory of Computing p.233-247
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding

your query:: Remove keywords: Cutting planes