1 – 10 of 19
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2025
-
Mark
Truly supercritical trade-offs for resolution, cutting planes, monotone circuits, and Weisfeiler-Leman
De Rezende, Susanna F. LU
; Fleming, Noah
; 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
- 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
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
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
De Rezende, Susanna F. LU
; Meir, Or
; Nordström, Jakob
LU
and Robere, Robert
(2021)
In Computational Complexity
30(1).
- Contribution to journal › Article
-
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
-
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
- 2020
-
Mark
Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
de Rezende, Susanna F. LU
; Nordström, Jakob
LU
; Risse, Kilian
and Sokolov, Dmitry
LU
(2020)
35th Computational Complexity Conference, CCC 2020
In Leibniz International Proceedings in Informatics, LIPIcs
169.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding