Pages that link to "Item:Q690458"

The following pages link to Spin systems on \(k\)-regular graphs with complex edge functions (Q690458):

Displaying 13 items.

• The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
• Holant problems for 3-regular graphs with complex edge functions (Q315538) (← links)
• Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions (Q391089) (← links)
• A collapse theorem for holographic algorithms with matchgates on domain size at most 4 (Q476175) (← links)
• Holographic algorithms beyond matchgates (Q1706145) (← links)
• Holographic reduction, interpolation and hardness (Q1926111) (← links)
• The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← 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)
• A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory (Q4993265) (← links)
• On the Complexity of Holant Problems (Q4993599) (← links)
• A complexity trichotomy for \(k\)-regular asymmetric spin systems using number theory (Q6113105) (← links)
• A complexity trichotomy for \(k\)-regular asymmetric spin systems with complex edge functions (Q6634373) (← links)