Pages that link to "Item:Q2032295"

The following pages link to Dichotomy for Holant\(^\ast\) problems on the Boolean domain (Q2032295):

Displaying 10 items.

• From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (Q1934313) (← links)
• FKT is not universal -- a planar holant dichotomy for symmetric constraints (Q2075391) (← links)
• A complete dichotomy rises from the capture of vanishing signatures (Q2817798) (← links)
• The Complexity of Boolean Holant Problems with Nonnegative Weights (Q4571918) (← links)
• Holographic algorithm with matchgates is universal for planar #CSP over boolean domain (Q4978028) (← links)
• (Q5111359) (← links)
• A complete dichotomy rises from the capture of vanishing signatures (Q5495834) (← links)
• The complexity of symmetric Boolean parity Holant problems (Q5891075) (← links)
• Complexity classification of the eight-vertex model (Q6116195) (← links)
• Restricted Holant dichotomy on domain sizes 3 and 4 (Q6652438) (← links)