Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1112.1040

What makes normalized weighted satisfiability tractable

Iyad Kanj·Ge Xia
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the weighted antimonotone and the weighted monotone satisfiability problems on normalized circuits of depth at most $t \geq 2$, abbreviated {\sc wsat$^-[t]$} and {\sc wsat$^+[t]$}, respectively. These problems model the weighted satisfiability of antimonotone and monotone propositional formulas (including weighted anitmonoone/monotone {\sc cnf-sat}) in a natural way, and serve as the canonical problems in the definition of the parameterized complexity hierarchy. We characterize the parameterized complexity of {\sc wsat$^-[t]$} and {\sc wsat$^+[t]$} with respect to the genus of the circuit. For {\sc wsat$^-[t]$}, which is $W[t]$-complete for odd $t$ and $W[t-1]$-complete for even $t$, the characterization is precise: We show that {\sc wsat$^-[t]$} is fixed-parameter tractable (FPT) if the genus of the circuit is $n^{o(1)}$ ($n$ is the number of the variables in the circuit), and that it has the same $W$-hardness as the general {\sc wsat$^-[t]$} problem (i.e., with no restriction on the genus) if the genus is $n^{O(1)}$. For {\sc wsat$^+[2]$} (i.e., weighted monotone {\sc cnf-sat}), which is $W[2]$-complete, the characterization is also precise: We show that {\sc wsat$^+[2]$} is FPT if the genus is $n^{o(1)}$ and $W[2]$-complete if the genus is $n^{O(1)}$. For {\sc wsat$^+[t]$} where $t > 2$, which is $W[t]$-complete for even $t$ and $W[t-1]$-complete for odd $t$, we show that it is FPT if the genus is $O(\sqrt{\log{n}})$, and that it has the same $W$-hardness as the general {\sc wsat$^+[t]$} problem if the genus is $n^{O(1)}$.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Iyad Kanj, Ge Xia. 2011-12-05. What makes normalized weighted satisfiability tractable. https://arxiv.org/abs/1112.1040

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↗