The complexity of counting planar graph homomorphisms of domain size 3

Cites Work

Large networks and graph limits
Title not available (Why is that?)
Title not available (Why is that?)
The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
Reflection positivity, rank connectivity, and homomorphism of graphs
Dimer problem in statistical mechanics-an exact result
Title not available (Why is that?)
The complexity of computing the permanent
The complexity of partition functions
On the complexity of \#CSP
Title not available (Why is that?)
Nonnegative weighted \#CSP: an effective complexity dichotomy
Holographic Algorithms
Title not available (Why is that?)
Holant problems and counting CSP
A Complexity Dichotomy for Partition Functions with Mixed Signs
The complexity of the counting constraint satisfaction problem
The Computational Complexity of Tutte Invariants for Planar Graphs
Graph homomorphisms with complex values: a dichotomy theorem
An effective dichotomy for the counting constraint satisfaction problem
Title not available (Why is that?)
Quantum automorphism groups of homogeneous graphs
Graph homomorphisms for quantum players
The complexity of weighted and unweighted \(\#\)CSP
Holographic algorithms on bases of rank 2
Operations with structures
Complexity of counting CSP with complex weights
A New Holant Dichotomy Inspired by Quantum Computation
On blockwise symmetric matchgate signatures and higher domain \#CSP
A complete dichotomy rises from the capture of vanishing signatures
The Morita theory of quantum graph isomorphisms
Quantum and non-signalling graph isomorphisms
Perfect commuting-operator strategies for linear system games
A complete dichotomy for complex-valued \(\textsc{Holant}^c\)
FKT is not universal -- a planar holant dichotomy for symmetric constraints
Nonlocal games and quantum permutation groups
Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain
A dichotomy for bounded degree graph homomorphisms with nonnegative weights

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499302)