Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2206.10389

Parameterized-NL Completeness of Combinatorial Problems by Short Logarithmic-Space Reductions and Immediate Consequences of the Linear Space Hypothesis

Tomoyuki Yamakami
View original source ↗Read source document ↗Export metadata ↓

Abstract

The concept of space-bounded computability has become significantly important in handling vast data sets on memory-limited computing devices. To replenish the existing short list of NL-complete problems whose instance sizes are dictated by log-space size parameters, we propose new additions obtained directly from natural parameterizations of three typical NP-complete problems -- the vertex cover problem, the exact cover by 3-sets problem, and the 3-dimensional matching problem. With appropriate restrictions imposed on their instances, the proposed decision problems parameterized by appropriate size parameters are proven to be equivalent in computational complexity to either the parameterized $3$-bounded 2CNF Boolean formula satisfiability problem or the parameterized degree-$3$ directed $s$-$t$ connectivity problem by ``short'' logarithmic-space reductions. Under the assumption of the linear space hypothesis, furthermore, none of the proposed problems can be solved in polynomial time if the memory usage is limited to sub-linear space.

Explore related subjects

cs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tomoyuki Yamakami. 2022-06-21. Parameterized-NL Completeness of Combinatorial Problems by Short Logarithmic-Space Reductions and Immediate Consequences of the Linear Space Hypothesis. https://arxiv.org/abs/2206.10389

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↗