Pages that link to "Item:Q534558"
From MaRDI portal
The following pages link to A computational proof of complexity of some restricted counting problems (Q534558):
Displaying 8 items.
- A dichotomy for real weighted Holant problems (Q260401) (← 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)
- Spin systems on \(k\)-regular graphs with complex edge functions (Q690458) (← links)
- Holographic reduction, interpolation and hardness (Q1926111) (← links)
- From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (Q1934313) (← links)
- A Complete Dichotomy Rises from the Capture of Vanishing Signatures (Q2817798) (← links)
- On the Complexity of Holant Problems (Q4993599) (← links)
