Susanna F. de Rezende

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 31

Top Venues

CoRR

Electron. Colloquium Comput. Complex.

FOCS

Computational Complexity Conference

Royal Institute of Technology, Stockholm, Sweden (PHD)

Education History

Royal Institute of Technology, Stockholm, Sweden

PHD

Publications

Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
KRW Composition Theorems via Lifting. Comput. Complex. 33 (1) (2024)
Susanna F. de Rezende, Aaron Potechin, Kilian Risse
Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients. CoRR (2024)
Susanna F. de Rezende, Aaron Potechin, Kilian Risse
Clique Is Hard on Average for Unary Sherali-Adams. FOCS (2023)
Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz. FOCS (2023)
Susanna F. de Rezende, Mika Göös, Robert Robere
Proofs, Circuits, and Communication. CoRR (2022)
Susanna F. de Rezende, Mika Göös, Robert Robere
Guest Column: Proofs, Circuits, and Communication. SIGACT News 53 (1) (2022)
Susanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov
Automating algebraic proof systems is NP-hard. STOC (2021)
Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov
Clique Is Hard on Average for Regular Resolution. J. ACM 68 (4) (2021)
Susanna F. de Rezende
Automating Tree-Like Resolution in Time $n^{o(\log n)}$ Is ETH-Hard. Electron. Colloquium Comput. Complex. 28 (2021)
Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Dmitry Sokolov
The Power of Negative Reasoning. Computational Complexity Conference (2021)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Comput. Complex. 30 (1) (2021)
Susanna F. de Rezende, Jakob Nordström, Marc Vinyals
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). Electron. Colloquium Comput. Complex. 28 (2021)
Susanna F. de Rezende
Is ETH-Hard. LAGOS (2021)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
KRW Composition Theorems via Lifting. FOCS (2020)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. CoRR (2020)
Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov
Clique Is Hard on Average for Regular Resolution. CoRR (2020)
Or Meir, Jakob Nordström, Robert Robere, Susanna F. de Rezende
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Electron. Colloquium Comput. Complex. 27 (2020)
Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov, Susanna F. de Rezende
Automating Algebraic Proof Systems is NP-Hard. Electron. Colloquium Comput. Complex. 27 (2020)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. FOCS (2020)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. CoRR (2020)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
KRW Composition Theorems via Lifting. CoRR (2020)
Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. Computational Complexity Conference (2020)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
KRW Composition Theorems via Lifting. Electron. Colloquium Comput. Complex. 27 (2020)
Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. CoRR (2019)
Susanna F. de Rezende, Jakob Nordström, Or Meir, Robert Robere
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Computational Complexity Conference (2019)
Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. Electron. Colloquium Comput. Complex. 26 (2019)
Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Susanna F. de Rezende
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. Electron. Colloquium Comput. Complex. 26 (2019)
Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov
Clique is hard on average for regular resolution. STOC (2018)
Joël Alwen, Susanna F. de Rezende, Jakob Nordström, Marc Vinyals
Cumulative Space in Black-White Pebbling and Resolution. ITCS (2017)
Susanna F. de Rezende, Jakob Nordström, Marc Vinyals
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). FOCS (2016)
Júlio Araújo, Nathann Cohen, Susanna F. de Rezende, Frédéric Havet, Phablo F. S. Moura
On the proper orientation number of bipartite graphs. Theor. Comput. Sci. 566 (2015)
Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi
Intersecting longest paths. Discret. Math. 313 (11) (2013)
Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi
Intersection of Longest Paths in a Graph. Electron. Notes Discret. Math. 38 (2011)

Susanna F. de Rezende.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Susanna F. de Rezende