The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We introduce a new type of closure operator on the set of relations, max-implementation, and its weaker analog max-quantification. Then we show that approximation preserving reductions between counting constraint satisfaction problems (#CSPs) are preserved by these two types of closure operators. Together with some previous results this means that the approximation complexity of counting CSPs is determined by partial clones of relations that additionally closed under these new types of closurearXiv:1210.3344v1 fatcat:bli7tjoyivcmhidf2e3yt7icum