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 11 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)
- Computational complexity of counting problems on 3-regular planar graphs (Q2382289) (← links)
- A complete dichotomy rises from the capture of vanishing signatures (Q2817798) (← links)
- The computational complexity of some classical problems from statistical physics (Q3972641) (← links)
- On the Complexity of Holant Problems (Q4993599) (← links)
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard) (Q6670813) (← links)