Pages that link to "Item:Q1926111"

The following pages link to Holographic reduction, interpolation and hardness (Q1926111):

Displaying 7 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)
• Holographic algorithms beyond matchgates (Q1706145) (← links)
• The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
• The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
• A Complete Dichotomy Rises from the Capture of Vanishing Signatures (Q2817798) (← links)
• On the Complexity of Holant Problems (Q4993599) (← links)