The complexity of approximating conservative counting CSPs

Chen, X, Dyer, M, Goldberg, LA et al. (4 more authors) (2013) The complexity of approximating conservative counting CSPs. In: Portier, N and Wilke, T, (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 30th Symposium on Theoretical Aspects of Computer Science (STACS’13), 27 Feb - 02 Mar 2013, Kiel, Germany. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik, Dagstuhl Publishing , pp. 148-159.

Abstract

Metadata

Authors/Creators:
  • Chen, X
  • Dyer, M
  • Goldberg, LA
  • Jerrum, M
  • Lu, P
  • McQuillan, C
  • Richerby, D
Copyright, Publisher and Additional Information: (c) Chen, Dyer, Goldberg, Jerrum, McQuillan, and Richerby; licensed under Creative Commons License BY-ND
Keywords: counting constraint satisfaction problem, approximation, complexity
Dates:
  • Published: 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: 11 Jul 2016 15:37
Last Modified: 11 Jul 2016 15:37
Published Version: http://doi.org/10.4230/LIPIcs.STACS.2013.148
Status: Published
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik, Dagstuhl Publishing
Identification Number: https://doi.org/10.4230/LIPIcs.STACS.2013.148

Share / Export

Statistics