Skip to content
Log in
Sponsored AI AM CLAUDE, A Beginner's Guide: Learn the basics of working with AI AI AM CLAUDE, A Beginner's Guide: Learn the basics of working with AI

Author

Markus Lohrey

View on Semantic Scholar

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Compressed Subsequence Checking is PSPACE-complete

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.

Markus Lohrey · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.