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

Leslie Ann Goldberg, Steven Kelk, Mike Paterson

Research output: Contribution to conferencePaperAcademic

Original languageEnglish
Pages53
DOIs
Publication statusPublished - 2002
Externally publishedYes
Event34th ACM Symposium on Theory of Computing - Montréal, Canada
Duration: 19 May 200221 May 2002
http://acm-stoc.org/stoc2002/

Conference

Conference34th ACM Symposium on Theory of Computing
Abbreviated titleSTOC2002
CountryCanada
CityMontréal
Period19/05/0221/05/02
Internet address

Cite this