The complexity of approximating bounded-degree Boolean #CSP (2012)

First Author: Dyer M
Attributed to:  The Complexity of Counting in Constraint Satisfaction Problems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1016/j.ic.2011.12.007

Publication URI: http://dx.doi.org/10.1016/j.ic.2011.12.007

Type: Journal Article/Review

Parent Publication: Information and Computation