Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1810.04190

Uniform CSP Parameterized by Solution Size is in W[1]

Ruhollah Majdoddin
View original source ↗Read source document ↗Export metadata ↓

Abstract

We show that the uniform Constraint Satisfaction Problem (CSP) parameterized by the size of the solution is in W[1] (the problem is W[1]-hard and it is easy to place it in W[3]). Given a single "free" element of the domain, denoted by $0$, we define the size of an assignment as the number of variables that are mapped to a value other than $0$. Named by Kolaitis and Vardi (2000), uniform CSP means that the input contains the domain and the list of tuples of each relation in the instance. Uniform CSP is polynomial time equivalent to homomorphism problem and also to evaluation of conjunctive queries on relational databases. It also has applications in artificial intelligence. We do not restrict the problem to any (finite or infinite) family of relations. Marx and Bulatov (2014) showed that Uniform CSP restricted to some finite family of relations (thus with a bound on the arity of relations) and over any finite domain is either W[1]-complete or fixed parameter tractable. We then prove that parameterized Subset Sum with weights bounded by $n^k$ is in W[1]. Abboud et al. (2014) have already proved it, but our proof is much shorter and arguably more intuitive. Lastly, we study the weighted CSP over the Boolean Domain, where each variable is assigned a weight, and given a target value, it should be decided if there is a satisfying assignment of size $k$ (the parameter) such that the weight of its $1$-variables adds up to the target value. We prove that if the weights are bounded by $n^k$, then the problem is in W[1]. Our proofs give a nondeterministic RAM program with special properties deciding the problem. First defined by Chen et al. (2005), such programs characterize W[1].

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Ruhollah Majdoddin. 2018-10-09. Uniform CSP Parameterized by Solution Size is in W[1]. https://arxiv.org/abs/1810.04190

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗