Key points are not available for this paper at this time.
We show that computing the smallest run-length straight line program (RLSLP) and the smallest collage system is NP-hard. For computing the smallest RLSLP, we give an encoding in MAX-SAT.
Kawamoto et al. (Tue,) studied this question.