Research output per year
Research output per year
Personal profile
Research
My research interests are in computational complexity, in particular connections between proof, circuit and communication complexity. You can read more about me here: https://derezende.github.io/
Fingerprint
Dive into the research topics where Susanna de Rezende is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
ETH-Hardness of Learning Monotone Circuits and Approximating Their Size
Cavalar, B., de Rezende, S. F., Gray, M. & Santhanam, R., 2026 Jul 23, 41st Computational Complexity Conference, CCC 2026. Moshkovitz, D. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 40. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 383).Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review
Open Access -
Average-case hardness of binary-encoded clique in proof and communication complexity
de Rezende, S. F., Engström, D., Ghannane, Y., Janett, D. A. & Riazanov, A., 2026 Jul 1, 53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026. Bhattacharya, S., Nanongkai, D., Benedikt, M. & Puppis, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 23 p. 151. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 374).Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review
Open Access -
Lifting with colourful sunflowers
de Rezende, S. F. & Vinyals, M., 2025 Jul 29, 40th Computational Complexity Conference, CCC 2025: CCC 2025, August 5–8, 2025, Toronto, Canada. Srinivasan, S. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 19 p. (LIPIcs : Leibniz international proceedings in informatics; vol. 339).Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review
Open Access -
On the automatability of tree-like k-DNF resolution
Carenini, G. & de Rezende, S. F., 2025 Jul 29, 40th Computational Complexity Conference, CCC 2025: CCC 2025, August 5–8, 2025, Toronto, Canada. Srinivasan, S. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 21 p. (LIPIcs : Leibniz international proceedings in informatics; vol. 339).Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review
Open Access -
Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
De Rezende, S. F., Nordström, J., Risse, K. & Sokolov, D., 2025, In: TheoretiCS. 4, 46 p., 9.Research output: Contribution to journal › Article › peer-review
Open Access
Projects
- 1 Active
-
Certified Linear Pseudo-Boolean Optimization
Oertel, A. (Researcher), Nordström, J. (Supervisor) & de Rezende, S. (Assistant supervisor)
2021/11/16 → …
Project: Dissertation
-
Complexity as a kaleidoscope
de Rezende, S. (Role not specified)
2025 Mar 31 → 2025 Apr 4Activity: Participating in or organising an event › Organisation of workshop/ seminar/ course
-
Invited talk: Some Recent Advancements in Monotone Circuit Complexity
de Rezende, S. (Role not specified)
2025 Mar 7Activity: Talk or presentation › Invited talk