default search action
Susanna F. de Rezende
Person information
- affiliation: Lund University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Susanna F. de Rezende
, Or Meir, Jakob Nordström
KRW Composition Theorems via Lifting. Comput. Complex. 33(1): 4 (2024) - [i15]Susanna F. de Rezende, Aaron Potechin, Kilian Risse:
Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients. CoRR abs/2404.16722 (2024) - [i14]Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang:
Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman. Electron. Colloquium Comput. Complex. TR24: TR24-185 (2024) - 2023
- [c12]Jonas Conneryd, Susanna F. de Rezende
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz. FOCS 2023: 1-11 - [c11]Susanna F. de Rezende
Clique Is Hard on Average for Unary Sherali-Adams. FOCS 2023: 12-25 - 2022
- [j6]Susanna F. de Rezende, Mika Göös, Robert Robere:
Guest Column: Proofs, Circuits, and Communication. SIGACT News 53(1): 59-82 (2022) - [i13]Susanna F. de Rezende, Mika Göös, Robert Robere:
Proofs, Circuits, and Communication. CoRR abs/2202.08909 (2022) - 2021
- [j5]Susanna F. de Rezende
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Comput. Complex. 30(1): 4 (2021) - [j4]Albert Atserias, Ilario Bonacina
Clique Is Hard on Average for Regular Resolution. J. ACM 68(4): 23:1-23:26 (2021) - [c10]Susanna F. de Rezende
The Power of Negative Reasoning. CCC 2021: 40:1-40:24 - [c9]Susanna F. de Rezende
Automating Tree-Like Resolution in Time no(log n) Is ETH-Hard. LAGOS 2021: 152-162 - [c8]Susanna F. de Rezende
Automating algebraic proof systems is NP-hard. STOC 2021: 209-222 - [i12]Susanna F. de Rezende:
Automating Tree-Like Resolution in Time no(log n) Is ETH-Hard. Electron. Colloquium Comput. Complex. TR21 (2021) - [i11]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. TR21 (2021) - 2020
- [c7]Susanna F. de Rezende
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. CCC 2020: 28:1-28:24 - [c6]Susanna F. de Rezende
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. FOCS 2020: 24-30 - [c5]Susanna F. de Rezende
KRW Composition Theorems via Lifting. FOCS 2020: 43-49 - [i10]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 abs/2001.02144 (2020) - [i9]Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere:
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. CoRR abs/2001.02481 (2020) - [i8]Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere:
KRW Composition Theorems via Lifting. CoRR abs/2007.02740 (2020) - [i7]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 abs/2012.09476 (2020) - [i6]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. TR20 (2020) - [i5]Or Meir, Jakob Nordström, Robert Robere, Susanna F. de Rezende:
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Electron. Colloquium Comput. Complex. TR20 (2020) - [i4]Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere:
KRW Composition Theorems via Lifting. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [b1]Susanna F. de Rezende:
Lower Bounds and Trade-offs in Proof Complexity. Royal Institute of Technology, Stockholm, Sweden, 2019 - [c4]Susanna F. de Rezende
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. CCC 2019: 18:1-18:16 - [i3]Susanna F. de Rezende, Jakob Nordström, Kilian Risse
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. CoRR abs/1912.00534 (2019) - [i2]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. TR19 (2019) - [i1]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. TR19 (2019) - 2018
- [c3]Albert Atserias, Ilario Bonacina
Clique is hard on average for regular resolution. STOC 2018: 866-877 - 2017
- [c2]Joël Alwen, Susanna F. de Rezende
Cumulative Space in Black-White Pebbling and Resolution. ITCS 2017: 38:1-38:21 - 2016
- [c1]Susanna F. de Rezende
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). FOCS 2016: 295-304 - 2015
- [j3]Júlio Araújo
On the proper orientation number of bipartite graphs. Theor. Comput. Sci. 566: 59-75 (2015) - 2013
- [j2]Susanna F. de Rezende
Intersecting longest paths. Discret. Math. 313(11): 1401-1408 (2013) - 2011
- [j1]Susanna F. de Rezende
Intersection of Longest Paths in a Graph. Electron. Notes Discret. Math. 38: 743-748 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-22 20:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: