Pages that link to "Item:Q619900"

The following pages link to Holographic algorithms: from art to science (Q619900):

Displaying 7 items.

• 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)
• The complexity of complex weighted Boolean \#CSP (Q395011) (← links)
• A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs (Q443724) (← links)
• Spin systems on \(k\)-regular graphs with complex edge functions (Q690458) (← links)
• Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems (Q690466) (← links)
• Clifford gates in the Holant framework (Q1786604) (← links)