Susanna F. de Rezende

According to our database, Susanna F. de Rezende authored at least 26 papers between 2011 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

The Proof Analysis Problem.

Noel Arteche, Albert Atserias, Susanna F. de Rezende, Erfan Khaniki

CoRR, June, 2025

Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman.

Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Some Recent Advancements in Monotone Circuit Complexity (Invited Talk).

Susanna F. de Rezende

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

Lifting with Colourful Sunflowers.

Susanna F. de Rezende, Marc Vinyals

Proceedings of the 40th Computational Complexity Conference, 2025

On the Automatability of Tree-Like k-DNF Resolution.

Gaia Carenini, Susanna F. de Rezende

Proceedings of the 40th Computational Complexity Conference, 2025

2024

Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients.

Susanna F. de Rezende, Aaron Potechin, Kilian Risse

CoRR, 2024

2023

Clique Is Hard on Average for Unary Sherali-Adams.

Susanna F. de Rezende, Aaron Potechin, Kilian Risse

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz.

Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Guest Column: Proofs, Circuits, and Communication.

Susanna F. de Rezende, Mika Göös, Robert Robere

SIGACT News, 2022

Proofs, Circuits, and Communication.

Susanna F. de Rezende, Mika Göös, Robert Robere

CoRR, 2022

2021

Automating Tree-Like Resolution in Time n^{o(log n)} Is ETH-Hard.

Susanna F. de Rezende

Electron. Colloquium Comput. Complex., 2021

Automating algebraic proof systems is NP-hard.

Susanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Automating Tree-Like Resolution in Time <i>n</i>^{<i>o</i>(log <i>n</i>)} Is ETH-Hard.

Susanna F. de Rezende

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

The Power of Negative Reasoning.

Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Dmitry Sokolov

Proceedings of the 36th Computational Complexity Conference, 2021

2020

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity.

Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

KRW Composition Theorems via Lifting.

Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs.

Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov

Proceedings of the 35th Computational Complexity Conference, 2020

2019

Lower Bounds and Trade-offs in Proof Complexity.

Susanna F. de Rezende

PhD thesis, 2019

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity.

Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Susanna F. de Rezende

Electron. Colloquium Comput. Complex., 2019

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling.

Susanna F. de Rezende, Jakob Nordström, Or Meir, Robert Robere

Proceedings of the 34th Computational Complexity Conference, 2019

2018

Clique is hard on average for regular resolution.

Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

Cumulative Space in Black-White Pebbling and Resolution.

Joël Alwen, Susanna F. de Rezende, Jakob Nordström, Marc Vinyals

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016

How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity).

Susanna F. de Rezende, Jakob Nordström, Marc Vinyals

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

On the proper orientation number of bipartite graphs.

Júlio Araújo, Nathann Cohen, Susanna F. de Rezende, Frédéric Havet, Phablo F. S. Moura

Theor. Comput. Sci., 2015

2013

Intersecting longest paths.

Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi

Discret. Math., 2013

2011

Intersection of Longest Paths in a Graph.

Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2011