The complexity of choosing an <i>H</i>-colouring (nearly) uniformly at random

Similar Works

Action	Title	Year	Authors
+	The complexity of choosing an <i>H</i> -colouring (nearly) uniformly at random	2002	Leslie Ann Goldberg Steven Kelk Mike Paterson
+	The Complexity of Choosing an <i>H</i>-Coloring (Nearly) Uniformly at Random	2004	Leslie Ann Goldberg Steven Kelk Mike Paterson
+	Counting and sampling H-colourings	2003	Martin Dyer Leslie Ann Goldberg Mark Jerrum
+	Counting and Sampling H-Colourings	2002	Martin Dyer Leslie Ann Goldberg Mark Jerrum
+ PDF Chat	Approximate counting, uniform generation and rapidly mixing Markov chains	1989	Alistair Sinclair Mark Jerrum
+	The Amazing Power of Randomness: NP=RP	2020	András Faragó
+ PDF Chat	Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model	2011	Andreas Galanis Qi Ge Daniel Štefankovič Eric Vigoda Linji Yang
+ PDF Chat	Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard	2016	Andreas Galanis Leslie Ann Goldberg Mark Jerrum
+	Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$-Hard	2015	Andreas Galanis Leslie Ann Goldberg Mark Jerrum
+	Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model	2011	Andreas Galanis Qi Ge Daniel Štefankovič Eric Vigoda Linji Yang
+	Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets	2011	Ricardo Restrepo Jinwoo Shin Prasad Tetali Eric Vigoda Linji Yang
+ PDF Chat	Random sampling of colourings of sparse random graphs with a constant number of colours	2008	Charilaos Efthymiou Paul G. Spirakis
+ PDF Chat	Path coupling: A technique for proving rapid mixing in Markov chains	2002	Russ Bubley Martin Dyer
+	Switching Colouring of G(n,d/n) for Sampling up to Gibbs Uniqueness Threshold	2014	Charilaos Efthymiou
+ PDF Chat	On Sampling Colorings of Bipartite Graphs	2006	Rajalakshmi Balasubramanian C. R. Subramanian
+	Computational Transition at the Uniqueness Threshold	2010	Allan Sly
+	Algorithms for Colouring Random k-colourable Graphs	2000	C. R. Subramanian
+	A graph polynomial for independent sets of bipartite graphs	2009	Qi Ge Daniel Štefankovič
+	A graph polynomial for independent sets of bipartite graphs	2009	Qi Ge Daniel Štefankovič
+	A simple algorithm for sampling colourings of $G(n,d/n)$ up to Gibbs Uniqueness Threshold	2016	Charilaos Efthymiou

Works That Cite This (2)

Action	Title	Year	Authors
+	The complexity of partition functions	2005	Andreĭ A. Bulatov Martin Grohe
+	The Complexity of Partition Functions	2004	Andreǐ A. Bulatov Martin Grohe

Works Cited by This (0)

Action	Title	Year	Authors