Theoretical computer science · Oct 6, 2026
A factor-two approximation for shortest common superstring
Gives a deterministic polynomial-time algorithm constructing a common superstring of length at most twice the optimum for every finite family of explicitly represented strings. The running time is polynomial in the full encoded input length, including symbol labels.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model