The complexity of counting planar graph homomorphisms of domain size 3

Cites work

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

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)