Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2311.06563

Color Structures and the Monotone Satisfiability Problem with Bounded Variable Occurrence

Hannah Van Santvliet·Ronald de Haan
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study \textsc{Monotone 3-Sat-$(\leq k,1)$}, a restricted variant of the \textsc{Satisfiability} problem where clauses consist of three variables and are monotone (every clause contains either only unnegated or only negated variables) with up to $k$ positive and exactly one negative occurrence per variable in the formula. We resolve a challenge posed by Darmann and D\"ocker (On simplified NP-complete variants of \textsc{Monotone} 3-\textsc{Sat}, Discrete Applied Mathematics 292:45--58, 2021) by proving that for~$k\in \{3,4\}$, the problem is trivial in the sense that every instance satisfying the given restrictions is satisfiable. This result closes the remaining gap in a dichotomy theorem: Triviality for $k\in \{1,2\}$ follows by a result by Tovey (A simplified NP-complete satisfiability problem, Discrete Applied Mathematics 8(1):85--89, 1984), while NP-completeness for~$k\geq 5$ was shown by Darmann and D\"ocker. To obtain our result, we introduce the notion of \emph{color structures} and show that a satisfying assignment can always be constructed in $\mathcal{O}(n \cdot m)$ time, where $n$ and $m$ denote the number of negative and positive clauses of the input formula, respectively.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Hannah Van Santvliet, Ronald de Haan. 2023-11-11. Color Structures and the Monotone Satisfiability Problem with Bounded Variable Occurrence. https://arxiv.org/abs/2311.06563

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↗