Back to Search Start Over

The Expressibility of Functions on the Boolean Domain, with Applications to Counting CSPs.

Authors :
BULATOV, ANDREI A.
DYER, MARTIN
GOLDBERG, LESLIE ANN
JERRUM, MARK
McQUILLAN, COLIN
Source :
Journal of the ACM; Oct2013, Vol. 60 Issue 5, p1-36, 36p
Publication Year :
2013

Abstract

An important tool in the study of the complexity of Constraint Satisfaction Problems (CSPs) is the notion of a relational clone, which is the set of all relations expressible using primitive positive formulas over a particular set of base relations. Post's lattice gives a complete classification of all Boolean relational clones, and this has been used to classify the computational difficulty of CSPs. Motivated by a desire to understand the computational complexity of (weighted) counting CSPs, we develop an analogous notion of functional clones and study the landscape of these clones. One of these clones is the collection of log-supermodular (lsm) functions, which turns out to play a significant role in classifying counting CSPs. In the conservative case (where all nonnegative unary functions are available), we show that there are no functional clones lying strictly between the clone of lsm functions and the total clone (containing all functions). Thus, any counting CSP that contains a single nontrivial non-lsm function is computationally as hard to approximate as any problem in #P. Furthermore, we show that any nontrivial functional clone (in a sense that will be made precise) contains the binary function "implies". As a consequence, in the conservative case, all nontrivial counting CSPs are as hard to approximate as #BIS, the problem of counting independent sets in a bipartite graph. Given the complexity-theoretic results, it is natural to ask whether the "implies" clone is equivalent to the clone of lsm functions. We use the Möbius transform and the Fourier transform to show that these clones coincide precisely up to arity 3. It is an intriguing open question whether the lsm clone is finitely generated. Finally, we investigate functional clones in which only restricted classes of unary functions are available. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
00045411
Volume :
60
Issue :
5
Database :
Complementary Index
Journal :
Journal of the ACM
Publication Type :
Academic Journal
Accession number :
91749661
Full Text :
https://doi.org/10.1145/2528401