Christoph Berkholz
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 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 |
|---|---|---|
| Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps | Symmetry, Logic, Computation 2016 | 2016-11-07 |
Proves that for every k there exist n‑vertex relational structures that are k‑variable distinguishable but require quantifier rank at least n^{Ω(k / log k)}… | ||
| nothing matches | ||