TL;DR
This paper proves that the hypercube 2-segmentation problem, a biclustering challenge, is NP-hard, resolving a previously unproven claim about its computational complexity.
Contribution
It provides the first publicly available proof establishing the NP-hardness of the hypercube 2-segmentation problem.
Findings
Confirmed NP-hardness of hypercube 2-segmentation
Clarified computational complexity status
Resolved a long-standing open problem
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.