Scholar
Susanna F. de Rezende
Google Scholar ID: AZRM7A8AAAAJ
Lund University
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
362
H-index
11
i10-index
11
Publications
20
Co-authors
22
list available
Contact
No contact links provided.
Publications
7 items
ETH-Hardness of Learning Monotone Circuits and Approximating Their Size
2026
Cited
0
Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity
2026
Cited
0
Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
2026
Cited
0
The Proof Analysis Problem
2025
Cited
0
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
IEEE Annual Symposium on Foundations of Computer Science · 2023
Cited
1
KRW Composition Theorems via Lifting
IEEE Annual Symposium on Foundations of Computer Science · 2020
Cited
15
Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
Electron. Colloquium Comput. Complex. · 2019
Cited
3
Resume (English only)
Co-authors
22 total
Jakob Nordström
University of Copenhagen and Lund University
Robert Robere
McGill University
Marc Vinyals
University of Auckland
Co-author 4
Dmitry Sokolov
École Polytechnique Fédérale de Lausanne
Mika Göös
EPFL
Yoshiko Wakabayashi
Professor of Computer Science, University of São Paulo
Massimo Lauria
Sapienza - Università di Roma
