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

DOI10.1145/509907.509917MaRDI QIDQ3579223zbMATH OpenOpenAlexFDO

Authors Leslie Ann Goldberg, Steven Kelk, Mike Paterson

Publication date 5 August 2010

Published in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/509907.509917

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Cited in

(3)

• Counting and sampling \(H\)-colourings
• The complexity of partition functions
• Classification of a Class of Counting Problems Using Holographic Reductions

This page was built for publication: The complexity of choosing an H -colouring (nearly) uniformly at random

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579223)