« first day (2473 days earlier)      last day (1968 days later) » 

12:11 AM
5
Q: Word factorization in $O(n^2 \log n)$ time

Timon KniggeGiven two strings $S_1, S_2$, we write $S_1S_2$ for their concatenation. Given a string $S$ and integer $k\geq 1$, we write $(S)^k = SS\cdots S$ for the concatenation of $k$ copies of $S$. Now given a string, we can use this notation to 'compress' it, i.e. $AABAAB$ may be written as $((A)^2 B)^2$...

 

« first day (2473 days earlier)      last day (1968 days later) »