DeepAI AI Chat
Log In Sign Up

Approximate counting CSP seen from the other side

07/18/2019
by   Andrei A. Bulatov, et al.
University of Oxford
Simon Fraser University
0

In this paper we study the complexity of counting Constraint Satisfaction Problems (CSPs) of the form #CSP(C,-), in which the goal is, given a relational structure A from a class C of structures and an arbitrary structure B, to find the number of homomorphisms from A to B. Flum and Grohe showed that #CSP(C,-) is solvable in polynomial time if C has bounded treewidth [FOCS'02]. Building on the work of Grohe [JACM'07] on decision CSPs, Dalmau and Jonsson then showed that, if C is a recursively enumerable class of relational structures of bounded arity, then assuming FPT ≠ #W[1], there are no other cases of #CSP(C,-) solvable exactly in polynomial time (or even fixed-parameter time) [TCS'04]. We show that, assuming FPT ≠ W[1] (under randomised parametrised reductions) and for C satisfying certain general conditions, #CSP(C,-) is not solvable even approximately for C of unbounded treewidth; that is, there is no fixed parameter tractable (and thus also not fully polynomial) randomised approximation scheme for #CSP(C,-). In particular, our condition generalises the case when C is closed under taking minors.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/02/2022

Weighted Counting of Matchings in Unbounded-Treewidth Graph Families

We consider a weighted counting problem on matchings, denoted PrMatching...
08/28/2018

Approximately counting bases of bicircular matroids

We give a fully polynomial-time randomised approximation scheme (FPRAS) ...
03/23/2021

Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations

We study the complexity of approximating the number of answers to a smal...
09/29/2022

A dichotomy for succinct representations of homomorphisms

The task of computing homomorphisms between two finite relational struct...
05/19/2021

Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth

For the General Factor problem we are given an undirected graph G and fo...
12/15/2017

The HOMFLY-PT polynomial is fixed-parameter tractable

Many polynomial invariants of knots and links, including the Jones and H...
04/15/2019

Most IPs with bounded determinants can be solved in polynomial time

In 1983 Lenstra showed that an integer program (IP) is fixed parameter t...