Jin-Yi Cai
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 4 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| On the Power of Holographic Algorithms with Matchgates | The Classification Program of Counting Complexity | 2016-03-28 |
Classifies every Boolean complex-weighted counting CSP into exactly three cases: polynomial-time for all graphs, #P-hard on general graphs but polynomial-time… | ||
| The Classification Program for Counting Problems I | Counting Complexity and Phase Transitions Boot Camp | 2016-01-26 |
Covers the concrete claim that perfect matchings on planar graphs are computable in polynomial time by reducing the count to a Pfaffian via a Kasteleyn/FKT… | ||
| The Classification Program for Counting Problems II | Counting Complexity and Phase Transitions Boot Camp | 2016-01-26 |
Presents a concrete classification: symmetric Boolean constraint functions are either transformable into matchgate signatures and solved via Pfaffian… | ||
| Siegel's Theorem, Edge Coloring, and a Holant Dichotomy | Tensors in Computer Science and Geometry 2014 | 2014-11-10 |
Proves that for every kappa ≥ 3 the problem of counting proper k-edge‑colorings on k‑regular graphs is #P‑complete, by reducing a Tutte/top‑polynomial… | ||
| A Survey of Counting Dichotomies and Holographic Algorithms | Geometric Complexity Theory 2014 | 2014-09-15 |
Survey reports that reductions to weighted perfect matching and matchgates produce unexpected polynomial-time algorithms for many #P problems on planar inputs… | ||
| nothing matches | ||