Toggle navigation
Login
Toggle navigation
JavaScript is disabled for your browser. Some features of this site may not work without it.
The complexity of approximating conservative counting CSPs.
QMRO Home
School of Mathematical Sciences
Mathematics
The complexity of approximating conservative counting CSPs.
QMRO Home
School of Mathematical Sciences
Mathematics
The complexity of approximating conservative counting CSPs.
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
Most Popular Authors
The complexity of approximating conservative counting CSPs.
Volume
81
Pagination
311 - 329
Journal
J. Comput. Syst. Sci.
Metadata
Show full item record
Authors
Chen, X; Dyer, ME; Goldberg, LA; Jerrum, M; Lu, P; McQuillan, C; Richerby, D
URI
http://qmro.qmul.ac.uk/xmlui/handle/123456789/30088
Collections
Mathematics
[1421]
Copyright statements
© 2014 Elsevier Inc. All rights reserved.