Susanna F. de Rezende

45 papers A* 9A 7C 1Journal 27
YearRankTypeTitle / Venue / Authors
2025 J jnl
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs.
TheoretiCS
Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov
2025 J jnl
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz.
CoRR
Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse
2025 J jnl
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz.
Electron. Colloquium Comput. Complex.
Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse
2025 A conf
Lifting with Colourful Sunflowers.
CCC
Susanna F. de Rezende, Marc Vinyals
2025 A conf
On the Automatability of Tree-Like k-DNF Resolution.
CCC
Gaia Carenini, Susanna F. de Rezende
2025 A conf
Some Recent Advancements in Monotone Circuit Complexity (Invited Talk).
STACS
Susanna F. de Rezende
2025 A* conf
The Proof Analysis Problem.
FOCS
Noel Arteche, Albert Atserias, Susanna F. de Rezende, Erfan Khaniki
2025 J jnl
The Proof Analysis Problem.
CoRR
Noel Arteche, Albert Atserias, Susanna F. de Rezende, Erfan Khaniki
2025 A* conf
Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman.
STOC
Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang
2024 J jnl
Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients.
CoRR
Susanna F. de Rezende, Aaron Potechin, Kilian Risse
2024 J jnl
KRW Composition Theorems via Lifting.
Comput. Complex.
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
2024 J jnl
Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman.
CoRR
Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang
2024 J jnl
Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman.
Electron. Colloquium Comput. Complex.
Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang
2023 A* conf
Clique Is Hard on Average for Unary Sherali-Adams.
FOCS
Susanna F. de Rezende, Aaron Potechin, Kilian Risse
2023 A* conf
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz.
FOCS
Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse
2022 J jnl
Guest Column: Proofs, Circuits, and Communication.
SIGACT News
Susanna F. de Rezende, Mika Göös, Robert Robere
2022 J jnl
Proofs, Circuits, and Communication.
CoRR
Susanna F. de Rezende, Mika Göös, Robert Robere
2021 C conf
Automating Tree-Like Resolution in Time
LAGOS
Susanna F. de Rezende
2021 J jnl
Automating Tree-Like Resolution in Time n
Electron. Colloquium Comput. Complex.
Susanna F. de Rezende
2021 A* conf
Automating algebraic proof systems is NP-hard.
STOC
Susanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov
2021 J jnl
Clique Is Hard on Average for Regular Resolution.
J. ACM
Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov
2021 J jnl
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity).
Electron. Colloquium Comput. Complex.
Susanna F. de Rezende, Jakob Nordström, Marc Vinyals
2021 J jnl
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling.
Comput. Complex.
Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere
2021 A conf
The Power of Negative Reasoning.
CCC
Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Dmitry Sokolov
2020 J jnl
Automating Algebraic Proof Systems is NP-Hard.
Electron. Colloquium Comput. Complex.
Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov, Susanna F. de Rezende
2020 J jnl
Clique Is Hard on Average for Regular Resolution.
CoRR
Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov
2020 A conf
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs.
CCC
Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov
2020 A* conf
KRW Composition Theorems via Lifting.
FOCS
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
2020 J jnl
KRW Composition Theorems via Lifting.
CoRR
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
2020 J jnl
KRW Composition Theorems via Lifting.
Electron. Colloquium Comput. Complex.
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
2020 A* conf
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity.
FOCS
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals
2020 J jnl
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity.
CoRR
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals
2020 J jnl
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling.
CoRR
Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere
2020 J jnl
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling.
Electron. Colloquium Comput. Complex.
Or Meir, Jakob Nordström, Robert Robere, Susanna F. de Rezende
2019 J jnl
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs.
CoRR
Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov
2019 J jnl
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs.
Electron. Colloquium Comput. Complex.
Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov
2019 J jnl
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity.
Electron. Colloquium Comput. Complex.
Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Susanna F. de Rezende
2019 — —
Lower Bounds and Trade-offs in Proof Complexity.
Susanna F. de Rezende
2019 A conf
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling.
CCC
Susanna F. de Rezende, Jakob Nordström, Or Meir, Robert Robere
2018 A* conf
Clique is hard on average for regular resolution.
STOC
Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov
2017 A conf
Cumulative Space in Black-White Pebbling and Resolution.
ITCS
Joël Alwen, Susanna F. de Rezende, Jakob Nordström, Marc Vinyals
2016 A* conf
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity).
FOCS
Susanna F. de Rezende, Jakob Nordström, Marc Vinyals
2015 J jnl
On the proper orientation number of bipartite graphs.
Theor. Comput. Sci.
Júlio Araújo, Nathann Cohen, Susanna F. de Rezende, Frédéric Havet, Phablo F. S. Moura
2013 J jnl
Intersecting longest paths.
Discret. Math.
Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi
2011 J jnl
Intersection of Longest Paths in a Graph.
Electron. Notes Discret. Math.
Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi