Pages that link to "Item:Q428729"

The following pages link to A counterexample to rapid mixing of the Ge-Stefankovic process (Q428729):

Displaying 8 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)
• An improvement of the mixing rates in a counter-example to the weak invariance principle (Q889492) (← links)
• Approximately counting \(H\)-colorings is \(\#\)BIS-hard (Q2810271) (← links)
• A graph polynomial for independent sets of bipartite graphs (Q2908853) (← links)
• Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$-Hard (Q3448813) (← links)
• Counting independent sets in graphs with bounded bipartite pathwidth (Q6074656) (← links)