The complexity of counting locally maximal satisfying assignments of Boolean CSPs

View/Open
Volume
634
Pagination
35 - 46
DOI
10.1016/j.tcs.2016.04.008
Journal
THEORETICAL COMPUTER SCIENCE
ISSN
0304-3975
Metadata
Show full item record
Authors
Goldberg, LA; Jerrum, M
URI
http://qmro.qmul.ac.uk/xmlui/handle/123456789/12631
Collections
Licence information
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
Copyright statements
https://doi.org/10.1016/j.tcs.2016.04.008