Sub-exponential complexity of regular linear CNF formulas

Bernd R. Schuh

Home/Archive/arXiv

arXiv · 1812.09110

Sub-exponential complexity of regular linear CNF formulas

Bernd R. Schuh

View original source ↗Read source document ↗Export metadata ↓

Abstract

The study of regular linear conjunctive normal form (LCNF) formulas is of interest because exact satisfiability (XSAT) is known to be NP-complete for this class of formulas. In a recent paper it was shown that the subclass of regular exact LCNF formulas (XLCNF) is of sub-exponential complexity, i.e. XSAT can be determined in sub-exponential time. Here I show that this class is just a subset of a larger class of LCNF formulas which display this very kind of complexity. To this end I introduce the property of disjointedness of LCNF formulas, measured, for a single clause C, by the number of clauses which have no variable in common with C. If for a given LCNF formula F all clauses have the same disjointedness d we call F d-disjointed and denote the class of such formulas by dLCNF. XLCNF formulas correspond to the special cased=0. One main result of the paper is that the class of all monotone l-regular LCNF formulas which are d-disjointed, with d smaller than some upper bound D, is of sub-exponential complexity. This result can be generalized to show that all monotone, l-regular LCNF formulas F which have a bounded mean disjointedness, are of sub-exponential XSAT-complexity, as well.

Explore related subjects

cs.CC cs.DM math.LO

Keep this discovery

BibTeX RIS

Bernd R. Schuh. 2018-12-21. Sub-exponential complexity of regular linear CNF formulas. https://arxiv.org/abs/1812.09110

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

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

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↗