Name
Abstract | ||
|---|---|---|
Motivated by a desire to understand the computational complexity of counting constraint satisfaction problems (counting CSPs), particularly the complexity of approximation, we study functional clones of functions on the Boolean domain, which are analogous to the familiar relational clones constituting Post's lattice. 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 our study, we assume that non-negative unary functions (weights) are available. Given this, we prove 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 as any problem in #P. Furthermore, any non-trivial functional clone (in a sense that will be made precise below) contains the binary function "implies". As a consequence, all non-trivial counting CSPs (with non-negative unary weights assumed to be available) are computationally at least as difficult as #BIS, the problem of counting independent sets in a bipartite graph. There is empirical evidence that #BIS is hard to solve, even approximately. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.4230/LIPIcs.STACS.2012.302 | Leibniz International Proceedings in Informatics |
Keywords | DocType | Volume |
counting constraint satisfaction problems,approximation,complexity | Journal | 14 |
ISSN | Citations | PageRank |
1868-8969 | 6 | 0.76 |
References | Authors | |
12 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrei A. Bulatov | 1 | 1363 | 70.80 |
| Martin E. Dyer | 2 | 529 | 116.66 |
| leslie ann goldberg | 3 | 1411 | 125.20 |
| mark jerrum | 4 | 2755 | 564.62 |