📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

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