Susanna de Rezende
where else to find them
no profile links on file
what they talk about
their talks carry no tags yet
where they keep going back
no series more than once — all 2 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Proofs and Circuits: Connections via Interpolation and Lifting | 50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing | 2021-02-11 |
Proves equivalence between DAG-like communication for the Karchmer–Wigderson game and circuit size, extracts a protocol from a resolution refutation, and uses… | ||
| Clique Is Hard on Average for Regular Resolution | Boolean Devices 2018 | 2018-09-10 |
Proves that for random G (edge probability just below the K-clique threshold) and K up to n^{1/4}, any regular-resolution refutation of the unary clique… | ||
| nothing matches | ||