The complexity of choosing an H-colouring (nearly) uniformly at random

Research output: Contribution to conference › Paper › Academic

Original language	English
Pages	53
DOIs	https://doi.org/10.1145/509907.509917
Publication status	Published - 2002
Externally published	Yes
Event	34th ACM Symposium on Theory of Computing - Montréal, Canada Duration: 19 May 2002 → 21 May 2002 http://acm-stoc.org/stoc2002/

Symposium	34th ACM Symposium on Theory of Computing
Abbreviated title	STOC2002
Country/Territory	Canada
City	Montréal
Period	19/05/02 → 21/05/02
Internet address	http://acm-stoc.org/stoc2002/

Access to Document

@conference{c54616563d1941dfb28d0cc50848d54c,

title = "The complexity of choosing an H-colouring (nearly) uniformly at random",

author = "Goldberg, \{Leslie Ann\} and Steven Kelk and Mike Paterson",

year = "2002",

doi = "10.1145/509907.509917",

language = "English",

pages = "53",

note = "34th ACM Symposium on Theory of Computing, STOC2002 ; Conference date: 19-05-2002 Through 21-05-2002",

url = "http://acm-stoc.org/stoc2002/",

}