Dyer, M., Goldberg, L.A. and Jerrum, M. (2009) The complexity of weighted boolean #CSP*. Siam Journal on Computing, 38 (5). pp. 1970-1986. ISSN 0097-5397Full text available as:
Available under licence : See the attached licence file.
This paper gives a dichotomy theorem for the complexity of computing the partition function of an instance of a weighted Boolean constraint satisfaction problem. The problem is parameterized by a finite set F of nonnegative functions that may be used to assign weights to the configurations (feasible solutions) of a problem instance. Classical constraint satisfaction problems correspond to the special case of 0,1-valued functions. We show that computing the partition function, i.e., the sum of the weights of all configurations, is FP#P-complete unless either (1) every function in F is of “product type,” or (2) every function in F is “pure affine.” In the remaining cases, computing the partition function is in P.
|Copyright, Publisher and Additional Information:||© 2009 Society for Industrial and Applied Mathematics. Reproduced with permission from the publisher.|
|Keywords:||complexity theory, counting, #P, constraint satisfaction|
|Institution:||The University of Leeds|
|Academic Units:||The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)|
|Depositing User:||Miss Jamie Grant|
|Date Deposited:||20 Mar 2009 13:55|
|Last Modified:||06 Jun 2014 23:16|
|Publisher:||SIAM Society for Industrial and Applied Mathematics|
Actions (login required)