| dc.contributor.author | Galanis, A | en_US |
| dc.contributor.author | Goldberg, LA | en_US |
| dc.contributor.author | Jerrum, M | en_US |
| dc.date.accessioned | 2016-06-23T13:02:58Z | |
| dc.date.available | 2016-02-25 | en_US |
| dc.date.issued | 2016 | en_US |
| dc.date.submitted | 2016-05-27T10:56:04.568Z | |
| dc.identifier.issn | 0097-5397 | en_US |
| dc.identifier.uri | http://qmro.qmul.ac.uk/xmlui/handle/123456789/13055 | |
| dc.format.extent | 680 - 711 | en_US |
| dc.relation.ispartof | SIAM JOURNAL ON COMPUTING | en_US |
| dc.rights | “The final publication is available at http://link.springer.com/chapter/10.1007/978-3-662-47672-7_43” | |
| dc.subject | approximate counting | en_US |
| dc.subject | H-colorings | en_US |
| dc.subject | counting independent sets in bipartite graphs | en_US |
| dc.subject | graph homomorphisms | en_US |
| dc.title | APPROXIMATELY COUNTING H-COLORINGS IS #BIS-HARD | en_US |
| dc.type | Article | |
| dc.identifier.doi | 10.1137/15M1020551 | en_US |
| pubs.author-url | http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000385001000002&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=612ae0d773dcbdba3046f6df545e9f6a | en_US |
| pubs.issue | 3 | en_US |
| pubs.notes | Not known | en_US |
| pubs.publication-status | Published | en_US |
| pubs.volume | 45 | en_US |
