Pages that link to "Item:Q2826076"

The following pages link to Gadgets and anti-gadgets leading to a complexity dichotomy (Q2826076):

Displaying 7 items.

• The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
• A collapse theorem for holographic algorithms with matchgates on domain size at most 4 (Q476175) (← links)
• Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252) (← links)
• Holographic algorithms beyond matchgates (Q1706145) (← links)
• The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
• (Q3191606) (← links)
• A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory (Q4993265) (← links)