Year: 2026
Type: preprint
Abstract: It is shown that the (scattered) subsequence problem for two words represented by straight-line programs is $\mathsf{PSPACE}$-complete, even over a binary alphabet. The lower bound is obtained by a polynomial-time reduction from quantified subset sum. If the two words are given explicitly, i.e., uncompressed, then the subsequence problem is hard for uniform $\mathsf{NC}^1$ and in deterministic logspace.
Source: arXiv (Cornell University)
Author: Lohrey, Markus
Institution: University of Siegen
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7213296305
Cites:
Cited by:
Related to: