Jiabao Lin
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 |
|---|---|---|
| On the Complexity of #CSP^d | ITCS 2021 | 2021-01-06 |
Proves a full dichotomy for Counting-CSP^d: for any finite function set F over a finite domain the partition function is computable in polynomial time exactly… | ||
| nothing matches | ||