The complexity of counting planar graph homomorphisms of domain size 3

From MaRDI portal

Revision as of 14:59, 28 November 2024 by Import241128011130 (talk | contribs) (Created automatically from import241128011130)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6499302

Jump to:navigation, search

DOI10.1145/3564246.3585173WikidataQ130994387 ScholiaQ130994387MaRDI QIDQ6499302

Jin-Yi Cai, Ashwin Maran

Publication date: 8 May 2024

zbMATH Keywords

complexity dichotomy non-Boolean domain planar graph homomorphism

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: The complexity of counting planar graph homomorphisms of domain size 3

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6499302&oldid=37962073"