  The hypercube 2-segmentation problem is a certain biclustering problem that
was previously claimed to be NP-hard, but for which there does not appear to be
a publicly available proof of NP-hardness. This manuscript provides such a
proof.
