Susanna F. De Rezende

ScholarGPS® ID: 18537322180345

Affiliation

Czech Academy of Sciences, Prague, Czechia

Affiliation History

Field

Physical Sciences and Mathematics

Discipline

Mathematics

Top Specialties

Discrete Mathematics

Metrics Summary

Publication Count

Predicted Citations

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Clique Is Hard on Average for Regular Resolution (journal article) Atserias, Albert \| Bonacina, Ilario \| De Rezende, Susanna F. \| Lauria, Massimo \| Nordström, Jakob \| Razborov, Alexander Journal of the ACM, volume 68, issue 4, pages 1-26 (2021). 10.1145/3449352 Cited by (1) \| Cite \| Source
Automating algebraic proof systems is NP-hard (conference) de Rezende, Susanna F. \| Göös, Mika \| Nordström, Jakob \| Pitassi, Toniann \| Robere, Robert \| Sokolov, Dmitry STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing (2021) Virtual Italy 10.1145/3406325.3451080 Cited by (1) \| Cite \| Source
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling (journal article) De Rezende, Susanna F. \| Meir, Or \| Nordström, Jakob \| Robere, Robert computational complexity, volume 30, issue 1 (2021). 10.1007/s00037-020-00201-y Cited by (2) \| Cite \| Source
Automating Tree-Like Resolution in Time n(log ) Is ETH-Hard (journal article) de Rezende, Susanna F. Procedia Computer Science, volume 195 (2021). 10.1016/j.procs.2021.11.021 Cite \| Source
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity (conference) de Rezende, Susanna \| Meir, Or \| Nordstrom, Jakob \| Pitassi, Toniann \| Robere, Robert \| Vinyals, Marc 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) (2020) Durham, NC, USA 10.1109/FOCS46700.2020.00011 Cited by (4) \| Cite \| Source
KRW Composition Theorems via Lifting (conference) de Rezende, Susanna F. \| Meir, Or \| Nordstrom, Jakob \| Pitassi, Toniann \| Robere, Robert 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) (2020) Durham, NC, USA 10.1109/FOCS46700.2020.00013 Cited by (3) \| Cite \| Source
Clique is hard on average for regular resolution (conference) Atserias, Albert \| Bonacina, Ilario \| de Rezende, Susanna F. \| Lauria, Massimo \| Nordström, Jakob \| Razborov, Alexander STOC '18: Symposium on Theory of Computing (2018) Los Angeles CA USA 10.1145/3188745.3188856 Cited by (12) \| Cite \| Source \| Open Access
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity) (conference) de Rezende, Susanna F. \| Nordstrom, Jakob \| Vinyals, Marc 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) (2016) New Brunswick, NJ, USA 10.1109/FOCS.2016.40 Cited by (15) \| Cite \| Source
Caminhos mais longos em grafos (conference) de Rezende, Susanna \| Wakabayashi, Yoshiko Concurso de Teses e Dissertações (2015) Brasil 10.5753/ctd.2015.10001 Cite \| Source
On the proper orientation number of bipartite graphs (journal article) Araujo, Julio \| Cohen, Nathann \| de Rezende, Susanna F. \| Havet, Frédéric \| Moura, Phablo F.S. Theoretical Computer Science, volume 566 (2015). 10.1016/j.tcs.2014.11.037 Cited by (14) \| Cite \| Source \| Open Access
Intersecting longest paths (journal article) de Rezende, Susanna F. \| Fernandes, Cristina G. \| Martin, Daniel M. \| Wakabayashi, Yoshiko Discrete Mathematics, volume 313, issue 12, pages 1401-1408 (2013). 10.1016/j.disc.2013.02.016 Cited by (18) \| Cite \| Source \| Open Access
Intersection of Longest Paths in a Graph (journal article) de Rezende, Susanna F. \| Fernandes, Cristina G. \| Martin, Daniel M. \| Wakabayashi, Yoshiko Electronic Notes in Discrete Mathematics, volume 38 (2011). 10.1016/j.endm.2011.10.024 Cited by (2) \| Cite \| Source