Pages that link to "Item:Q5891164"

The following pages link to Graph homomorphisms with complex values: a dichotomy theorem (Q5891164):

Displaying 34 items.

• A dichotomy for real weighted Holant problems (Q260401) (← links)
• The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
• Counting \(4 \times 4\) matrix partitions of graphs (Q313799) (← links)
• Holant problems for 3-regular graphs with complex edge functions (Q315538) (← links)
• A collapse theorem for holographic algorithms with matchgates on domain size at most 4 (Q476175) (← links)
• A complexity dichotomy for hypergraph partition functions (Q626694) (← links)
• On the complexity of generalized chromatic polynomials (Q679542) (← links)
• Computing the partition function for graph homomorphisms (Q681595) (← links)
• Computing the partition function for graph homomorphisms with multiplicities (Q889510) (← links)
• Holographic algorithms beyond matchgates (Q1706145) (← links)
• The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
• Dichotomy for Holant\(^\ast\) problems on the Boolean domain (Q2032295) (← links)
• Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems (Q2060009) (← links)
• The complexity of counting \(\mathrm{CSP}^d\) (Q2075393) (← links)
• A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights (Q2323358) (← links)
• A dichotomy for bounded degree graph homomorphisms with nonnegative weights (Q2678252) (← links)
• Dichotomy theorems for homomorphism polynomials of graph classes (Q2790150) (← links)
• A complete dichotomy rises from the capture of vanishing signatures (Q2817798) (← links)
• Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
• Homeomorphism of 2-Complexes is Graph Isomorphism Complete (Q4286232) (← links)
• The Complexity of Boolean Holant Problems with Nonnegative Weights (Q4571918) (← links)
• Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials (Q4602373) (← links)
• Counting Constraint Satisfaction Problems. (Q4993601) (← links)
• A complete dichotomy for complex-valued \(\textsc{Holant}^c\) (Q5002678) (← links)
• (Q5005151) (← links)
• A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation (Q5096443) (← links)
• Dichotomy Theorems for Homomorphism Polynomials of Graph Classes (Q5176591) (← links)
• A Complexity Dichotomy for Partition Functions with Mixed Signs (Q5390598) (← links)
• Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP (Q5737812) (← links)
• Perfect matchings, rank of connection tensors and graph homomorphisms (Q5886319) (← links)
• Complexity classification of the eight-vertex model (Q6116195) (← links)
• The computational complexity of Holant problems on 3-regular graphs (Q6199389) (← links)
• A complexity trichotomy for \(k\)-regular asymmetric spin systems with complex edge functions (Q6634373) (← links)
• The complexity of ferromagnetic 2-spin systems on bounded degree graphs (Q6664055) (← links)