| dc.contributor.author | Goldberg, LA | en_US |
| dc.contributor.author | Jerrum, M | en_US |
| dc.date.accessioned | 2016-06-01T15:31:15Z | |
| dc.date.available | 2016-04-05 | en_US |
| dc.date.issued | 2016-06-27 | en_US |
| dc.date.submitted | 2016-05-18T16:17:00.008Z | |
| dc.identifier.issn | 0304-3975 | en_US |
| dc.identifier.uri | http://qmro.qmul.ac.uk/xmlui/handle/123456789/12631 | |
| dc.format.extent | 35 - 46 | en_US |
| dc.relation.ispartof | THEORETICAL COMPUTER SCIENCE | en_US |
| dc.relation.replaces | 123456789/13031 | |
| dc.relation.replaces | http://qmro.qmul.ac.uk/xmlui/handle/123456789/13031 | |
| dc.rights | This is a pre-copyedited, author-produced version of an article accepted for publication in Theoretical Computer Science following peer review. The version of record is available h http://www.sciencedirect.com/science/article/pii/S0304397516300366?via%3Dihub | |
| dc.subject | Constraint satisfaction problem | en_US |
| dc.subject | Computational complexity of counting problems | en_US |
| dc.subject | Approximate computation | en_US |
| dc.title | The complexity of counting locally maximal satisfying assignments of Boolean CSPs | en_US |
| dc.type | Article | |
| dc.rights.holder | https://doi.org/10.1016/j.tcs.2016.04.008 | |
| dc.identifier.doi | 10.1016/j.tcs.2016.04.008 | en_US |
| pubs.author-url | http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000377840900003&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=612ae0d773dcbdba3046f6df545e9f6a | en_US |
| pubs.notes | No embargo | en_US |
| pubs.publication-status | Published | en_US |
| pubs.volume | 634 | en_US |
