Let M be a real r × c matrix, and let k positive integer. In the column subset selection problem (CSSP), we need to minimize quantity ‖ − S A , where can an arbitrary runs over all submatrices of . This its applications in numerical linear algebra are being discussed for several decades, but algorithmic complexity remained open issue. We show that CSSP is NP-complete.
