The complexity of string partitioning

Anne Condon, Ján Maňuch, Chris Thachuk

Given a string $w$ over a finite alphabet $\Sigma$ and an integer $K$, can $w$ be partitioned into strings of length at most $K$, such that there are no \emph{collisions}? We refer to t…