Pages that link to "Item:Q428729"
From MaRDI portal
The following pages link to A counterexample to rapid mixing of the Ge-Stefankovic process (Q428729):
Displaying 5 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 stable matchings (Q441846) (← links)
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
- Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard (Q2810271) (← links)
- Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$-Hard (Q3448813) (← links)
