The Expressibility of Functions on the Boolean Domain, with Applications to Counting CSPs

Bulaov, AA, Dyer, M, Goldberg, LA et al. (2 more authors) (2013) The Expressibility of Functions on the Boolean Domain, with Applications to Counting CSPs. Journal of the ACM, 60 (5). 32. ISSN 1535-9921

Abstract

Metadata

Authors/Creators:
  • Bulaov, AA
  • Dyer, M
  • Goldberg, LA
  • Jerrum, M
  • McQuillan, C
Keywords: Approximation algorithms, computational complexity, constraint satisfaction problems, counting problems; Algorithms, Theory
Dates:
  • Published: October 2013
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 10 Aug 2016 15:40
Last Modified: 10 Aug 2016 15:40
Published Version: http://dx.doi.org/10.1145/2528401
Status: Published
Publisher: ACM
Identification Number: https://doi.org/10.1145/2528401

Download not available

A full text copy of this item is not currently available from White Rose Research Online

Share / Export

Statistics