Susanna F. de Rezende

According to our database1, Susanna F. de Rezende authored at least 13 papers between 2011 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
KRW Composition Theorems via Lifting.
Electron. Colloquium Comput. Complex., 2020

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling.
Electron. Colloquium Comput. Complex., 2020

Automating Algebraic Proof Systems is NP-Hard.
Electron. Colloquium Comput. Complex., 2020

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity.
CoRR, 2020

2019
Lower Bounds and Trade-offs in Proof Complexity.
PhD thesis, 2019

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs.
Electron. Colloquium Comput. Complex., 2019

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity.
Electron. Colloquium Comput. Complex., 2019

2018
Clique is hard on average for regular resolution.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017
Cumulative Space in Black-White Pebbling and Resolution.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity).
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
On the proper orientation number of bipartite graphs.
Theor. Comput. Sci., 2015

2013
Intersecting longest paths.
Discret. Math., 2013

2011
Intersection of Longest Paths in a Graph.
Electron. Notes Discret. Math., 2011


  Loading...