The following pages link to (Q5743449):
Displaying 10 items.
- \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470) (← links)
- The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs (Q342704) (← links)
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479) (← links)
- Zero-freeness and approximation of real Boolean Holant problems (Q2143138) (← links)
- A dichotomy for bounded degree graph homomorphisms with nonnegative weights (Q2678252) (← links)
- (Q5009527) (← links)
- Approximate Counting via Correlation Decay in Spin Systems (Q5743448) (← links)
- Approximability of the complementarily symmetric Holant problems on cubic graphs (Q6076358) (← links)
- Commuting quantum circuits and complexity of Ising partition functions (Q6100591) (← links)
- Approximation Algorithms for the Random Field Ising Model (Q6171258) (← links)
