Pages that link to "Item:Q260401"

The following pages link to A dichotomy for real weighted Holant problems (Q260401):

Displaying 20 items.

• A dichotomy for real weighted Holant problems (Q260401) (← links)
• On blockwise symmetric matchgate signatures and higher domain \#CSP (Q1633804) (← links)
• Holographic algorithms beyond matchgates (Q1706145) (← links)
• Complexity classification of the six-vertex model (Q1706146) (← links)
• Clifford gates in the Holant framework (Q1786604) (← links)
• The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
• Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
• FKT is not universal -- a planar holant dichotomy for symmetric constraints (Q2075391) (← links)
• The complexity of counting \(\mathrm{CSP}^d\) (Q2075393) (← links)
• A Complete Dichotomy Rises from the Capture of Vanishing Signatures (Q2817798) (← links)
• The Complexity of Boolean Holant Problems with Nonnegative Weights (Q4571918) (← links)
• A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory (Q4993265) (← links)
• On the Complexity of Holant Problems (Q4993599) (← links)
• (Q5002678) (← links)
• Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
• Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain (Q5073518) (← links)
• A complexity trichotomy for \(k\)-regular asymmetric spin systems using number theory (Q6113105) (← links)
• Complexity classification of the eight-vertex model (Q6116195) (← links)
• The computational complexity of Holant problems on 3-regular graphs (Q6199389) (← links)
• AntiFactor is FPT parameterized by treewidth and list size (but counting is hard) (Q6670813) (← links)