activity
20242026
most citedPolynomial and analytic methods for classifying complexity of planar graph homomorphisms

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing cs.CCShow all

2 papers · 1 filter

cs.CC2026

Planar Graph Homomorphisms: A Dichotomy and a Barrier from Quantum Groups

Jin-Yi Cai, Ashwin Maran, Ben Young

We study the complexity of counting (weighted) planar graph homomorphism problem parametrized by an arbitrary symmetric non-negative real valued matrix .…

cs.CC2024★ 1 cited

Polynomial and analytic methods for classifying complexity of planar graph homomorphisms

Jin-Yi Cai, Ashwin Maran

We introduce some polynomial and analytic methods in the classification program for the complexity of planar graph homomorphisms. These methods allow us to handle infinitely many l…