Show simple item record

dc.contributor.advisor2013. ACM
dc.contributor.authorBulatov, AAen_US
dc.contributor.authorDyer, Men_US
dc.contributor.authorGoldberg, LAen_US
dc.contributor.authorJerrum, Men_US
dc.contributor.authorMcquillan, Cen_US
dc.date.accessioned2016-01-05T13:27:37Z
dc.date.accessioned2016-01-06T13:24:53Z
dc.date.issued2013-10en_US
dc.date.submitted2016-01-06T10:47:53.218Z
dc.identifier.issn0004-5411en_US
dc.identifier.other32
dc.identifier.other32
dc.identifier.other32
dc.identifier.otherARTN 32en_US
dc.identifier.otherARTN 32en_US
dc.identifier.urihttp://qmro.qmul.ac.uk/xmlui/handle/123456789/10337
dc.description.sponsorshipSome of these results were announced in the preliminary papers Bulatov et al. [2012a] andMcQuillan [2011]. The work reported in this article was supported by an EPSRC Research Grant “Computational Counting” (refs. EP/I011528/1, EP/I011935/1, EP/I012087/1), by anNSERC Discovery Grant, and by an EPSRC doctoral training grant.en_US
dc.language.isoenen_US
dc.relation.ispartofJOURNAL OF THE ACMen_US
dc.relation.replaceshttp://qmro.qmul.ac.uk/xmlui/handle/123456789/10295
dc.relation.replaces123456789/10295
dc.subjectAlgorithmsen_US
dc.subjectTheoryen_US
dc.subjectApproximation algorithmsen_US
dc.subjectcomputational complexityen_US
dc.subjectconstraint satisfaction problemsen_US
dc.subjectcounting problemsen_US
dc.titleThe Expressibility of Functions on the Boolean Domain, with Applications to Counting CSPsen_US
dc.typeArticle
dc.identifier.doi10.1145/2528401en_US
pubs.author-urlhttp://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000326321500003&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=612ae0d773dcbdba3046f6df545e9f6aen_US
pubs.issue5en_US
pubs.notesNot knownen_US
pubs.publication-statusPublisheden_US
pubs.volume60en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record