Pages that link to "Item:Q4571918"
From MaRDI portal
The following pages link to The Complexity of Boolean Holant Problems with Nonnegative Weights (Q4571918):
Displaying 11 items.
- FKT is not universal -- a planar holant dichotomy for symmetric constraints (Q2075391) (← links)
- The complexity of counting \(\mathrm{CSP}^d\) (Q2075393) (← links)
- Zero-freeness and approximation of real Boolean Holant problems (Q2143138) (← links)
- Beyond \#CSP: a dichotomy for counting weighted Eulerian orientations with ARS (Q2216112) (← links)
- Dichotomy result on 3-regular bipartite non-negative functions (Q5918629) (← links)
- Dichotomy result on 3-regular bipartite non-negative functions (Q5925621) (← links)
- Approximability of the complementarily symmetric Holant problems on cubic graphs (Q6076358) (← links)
- A complexity trichotomy for \(k\)-regular asymmetric spin systems using number theory (Q6113105) (← links)
- Complexity classification of the eight-vertex model (Q6116195) (← links)
- The computational complexity of Holant problems on 3-regular graphs (Q6199389) (← links)
- Exponential time complexity of the complex weighted Boolean \#CSP (Q6591459) (← links)
