Toggle navigation
Login
Toggle navigation
The complexity of counting locally maximal satisfying assignments of Boolean CSPs
QMRO Home
Queen Mary University of London
College Publications
The complexity of counting locally maximal satisfying assignments of Boolean CSPs
QMRO Home
Queen Mary University of London
College Publications
The complexity of counting locally maximal satisfying assignments of Boolean CSPs
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browse
All of QMRO
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
Administrators only
Login
Statistics
Most Popular Items
Statistics by Country
The complexity of counting locally maximal satisfying assignments of Boolean CSPs
View/
Open
Accepted Version (212.1Kb)
ISSN
0304-3975
Metadata
Show full item record
Authors
JERRUM, MR
URI
http://qmro.qmul.ac.uk/xmlui/handle/123456789/12631
Collections
College Publications
[3797]
Licence information
doi:10.1016/j.tcs.2016.04.008
