Sorting by Strip Swaps is NP-Hard

Swapnoneel Roy, Asai Asaithambi, Debajyoti Mukhopadhyay

We show that \emph{Sorting by Strip Swaps} (SbSS) is NP-hard by a polynomial reduction of \emph{Block Sorting}. The key idea is a local gadget, a \emph{cage}, that replaces every d…