PAPER / ARXIV:2609.14490
Markus Lohrey
RESUMO
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.
NO MESMO MAPA