Anastasia Sofronova
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 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| A Lower Bound for k-DNF Resolution on Random CNF Formulas via Expansion | Proof Complexity and Meta-Mathematics 2023 | 2023-03-20 |
Proves that random m-clause CNFs whose clause-variable bipartite graph is a good boundary expander require Res(k) proofs of exponential size by converting… | ||
| nothing matches | ||