The complexity of weighted boolean #CSP*

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-5397

Abstract

Metadata

Authors/Creators:
  • Dyer, M.
  • Goldberg, L.A.
  • Jerrum, M.
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: 14 Nov 2016 19:14
Published Version: http://dx.doi.org/10.1137/070690201
Status: Published
Publisher: SIAM Society for Industrial and Applied Mathematics
Refereed: Yes
Identification Number: https://doi.org/10.1137/070690201

Download

Filename: Martin_Dyer_1.pdf

Share / Export

Statistics