Susanna Rezende

1 – 10 of 21

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/person/916c90dd-c72c-46a1-9339-9b900b57c24d?embed=1&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

« previous
1
2
3
next »

2025
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
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 On the automatability of tree-like k-DNF resolution
Carenini, Gaia and de Rezende, Susanna F. ^LU (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
2024
Mark KRW Composition Theorems via Lifting
Rezende, Susanna F.de ^LU ; Meir, Or ; Nordström, Jakob ^LU ; Pitassi, Toniann and Robere, Robert (2024) In Computational Complexity 33(1).
- 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
Mark Clique Is Hard on Average for Unary Sherali-Adams
De Rezende, Susanna F. ^LU ; Potechin, Aaron 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.12-25
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2021
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 (2021) In Journal of the ACM 68(4). p.1-26
- Contribution to journal › Article
Mark Automating Tree-Like Resolution in Time n^{o(log n)} Is ETH-Hard
De Rezende, Susanna F. ^LU (2021) XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021 In Procedia Computer Science 195. p.152-162
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
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
Mark Automating algebraic proof systems is NP-hard
De Rezende, Susanna F. ^LU ; Göös, Mika ; Nordström, Jakob ^LU ; Pitassi, Toniann ; Robere, Robert and Sokolov, Dmitry ^LU (2021) 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 In Proceedings of the Annual ACM Symposium on Theory of Computing p.209-222
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding

« previous
1
2
3
next »