Obserwuj
Susanna F. de Rezende
Susanna F. de Rezende
Lund University
Zweryfikowany adres z cs.lth.se - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
How limited interaction hinders real communication (and what it means for proof and circuit complexity)
SF de Rezende, J Nordström, M Vinyals
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
652016
Intersecting longest paths
SF de Rezende, CG Fernandes, DM Martin, Y Wakabayashi
Discrete Mathematics 313 (12), 1401-1408, 2013
332013
Clique is hard on average for regular resolution
A Atserias, I Bonacina, SF De Rezende, M Lauria, J Nordström, ...
Journal of the ACM (JACM) 68 (4), 1-26, 2021
322021
Lifting with simple gadgets and applications to circuit and proof complexity
S de Rezende, O Meir, J Nordström, T Pitassi, R Robere, M Vinyals
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 24-30, 2020
282020
Automating algebraic proof systems is NP-hard
SF De Rezende, M Göös, J Nordström, T Pitassi, R Robere, D Sokolov
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
25*2021
On the proper orientation number of bipartite graphs
J Araujo, N Cohen, SF De Rezende, F Havet, PFS Moura
Theoretical Computer Science 566, 59-75, 2015
222015
KRW Composition Theorems via Lifting
SF de Rezende, O Meir, J Nordström, T Pitassi, R Robere
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 43-49, 2020
182020
Cumulative space in black-white pebbling and resolution
J Alwen, SF de Rezende, J Nordström, M Vinyals
8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017
172017
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
SF De Rezende, O Meir, J Nordström, R Robere
computational complexity 30 (1), 1-45, 2021
14*2021
The Power of Negative Reasoning
SF de Rezende, M Lauria, J Nordström, D Sokolov
36th Computational Complexity Conference (CCC 2021), 2021
142021
Guest Column: Proofs, Circuits, and Communication
SF de Rezende, M Göös, R Robere
ACM SIGACT News 53 (1), 59-82, 2022
122022
Intersection of longest paths in a graph
SF de Rezende, CG Fernandes, DM Martin, Y Wakabayashi
Electronic Notes in Discrete Mathematics 38, 743-748, 2011
82011
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
SF de Rezende, J Nordström, K Risse, D Sokolov
arXiv preprint arXiv:1912.00534, 2019
72019
Automating Tree-Like Resolution in Time n^o(log n) Is ETH-Hard
SF de Rezende
https://eccc.weizmann.ac.il/report/2021/033/, 2021
52021
Clique is hard on average for unary Sherali-Adams
SF De Rezende, A Potechin, K Risse
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 12-25, 2023
42023
Lower Bounds and Trade-offs in Proof Complexity
SF de Rezende
KTH Royal Institute of Technology, 2019
32019
Covering Points with Unit Disks under Color Constraints
A Sapucaia, A Cire, P de Rezende, S de Rezende, C de Souza
Available at SSRN 4334380, 2023
22023
Caminhos mais longos em grafos
SF De Rezende
Dissertaçao de Mestrado, Instituto de Matemática e Estatıstica, Universidade …, 2014
22014
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
J Conneryd, SF De Rezende, J Nordström, S Pang, K Risse
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 1-11, 2023
12023
KRW Composition Theorems via Lifting
SF Rezende, O Meir, J Nordström, T Pitassi, R Robere
computational complexity 33 (1), 1-97, 2024
2024
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20