The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We give a trichotomy theorem for the complexity of approximately counting the number of satisfying assignments of a Boolean CSP instance. Such problems are parameterised by a constraint language specifying the relations that may be used in constraints. If every relation in the constraint language is affine then the number of satisfying assignments can be exactly counted in polynomial time. Otherwise, if every relation in the constraint language is in the co-clone IM_2 from Post's lattice, thenarXiv:0710.4272v2 fatcat:dxdbyt357jg4refsyexdkzf3fi