Dmitry Sokolov
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 |
|---|---|---|
| Random log(n)-CNF are Hard for Cutting Planes (Again) | Proof Complexity and Meta-Mathematics 2023 | 2023-03-20 |
Claim: random Δ=Θ(log n)-CNF formulas require hugely large Cutting Planes proofs. The proof builds a reduction from any Cutting Planes proof to a dag-like… | ||
| nothing matches | ||