Susanna F. de Rezende
where else to find them
no profile links on file
what they talk about
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 |
|---|---|---|
| Clique is hard on average for unary Sherali-Adams | Satisfiability: Theory, Practice, and Beyond 2023 | 2023-04-17 |
Claim: for G~G(n,1/2) with high probability, unary Sherali‑Adams needs size n^{Omega(log n)} to refute the existence of a k‑clique even when k = n^{Omega(1)}… | ||
| Average-Case Hardness in Proof Complexity | Rigorous Evidence for Information-Computation Trade-offs | 2021-09-13 |
Survey claims average-case refutation of random instances is the right way to prove strong proof-size lower bounds, and it demonstrates concrete tools… | ||
| nothing matches | ||