Mark Jerrum
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 |
|---|---|---|
| The Computational Complexity of Counting List H-Colourings, and Related Problems | The Classification Program of Counting Complexity | 2016-03-28 |
Gives a concrete trichotomy for approximating list H‑colourings: if every component of H is trivial it is in FP; if H is an irreflexive bipartite permutation… | ||
| nothing matches | ||