Uniform Sampling through the Lovasz Local Lemma

dc.contributor.author	Guo, H	en_US
dc.contributor.author	Jerrum, M	en_US
dc.contributor.author	Liu, J	en_US
dc.date.accessioned	2017-08-14T13:47:29Z
dc.date.available	2017-06-12	en_US
dc.date.issued	2017	en_US
dc.date.submitted	2017-08-07T09:11:59.992Z
dc.identifier.issn	0737-8017	en_US
dc.identifier.uri	http://qmro.qmul.ac.uk/xmlui/handle/123456789/25213
dc.format.extent	342 - 355	en_US
dc.rights	This is a pre-copyedited, author-produced version of an article accepted for publication in STOC 2017 Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing following peer review. The version of record is available http://dl.acm.org/citation.cfm?doid=3055399.3055410
dc.subject	Exact sampling	en_US
dc.subject	Lovasz Local Lemma	en_US
dc.subject	#SAT	en_US
dc.title	Uniform Sampling through the Lovasz Local Lemma	en_US
dc.type	Conference Proceeding
dc.rights.holder	© 2017 ACM
dc.identifier.doi	10.1145/3055399.3055410	en_US
pubs.author-url	http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000440317600035&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=612ae0d773dcbdba3046f6df545e9f6a	en_US
pubs.notes	Not known	en_US
pubs.publication-status	Published	en_US