Problem
Research questions and friction points this paper is trying to address.
PSPACE-complete
subsequence problem
straight-line programs
Compressed Subsequence Checking is PSPACE-complete
🤖 AI Summary
本文证明了通过直线程序表示的两个词的(分散)子序列问题在二进制字母表上是PSPACE完全的，使用量化子集和进行多项式时间规约来获得下界。
📝 Abstract
It is shown that the (scattered) subsequence problem for two words represented by straight-line programs is PSPACE-complete, even over a binary alphabet. The lower bound is obtained by a polynomial-time reduction from quantified subset sum.
Innovation
Methods, ideas, or system contributions that make the work stand out.
PSPACE-complete
straight-line programs
scattered subsequence problem
🔎 Similar Papers
No similar papers found.
