列子集选择是NP完全的
Column subset selection is NP-complete
摘要:
令$M$是实$r\times c$矩阵,令$k$是正整数。在列子集选择问题(CSSP)中,我们需要最小化$\|M-SA\|$的数量,其中$A$可以是任意的$k\times c$矩阵,$S$遍历$M$的所有$r\times k$子矩阵.这个问题及其在数值线性代数中的应用已经讨论了几十年,但其算法复杂性仍然是一个悬而未决的问题。我们证明了CSSP是NP完全的。
英文摘要:
Let $M$ be a real $r\times c$ matrix and let $k$ be a positive integer. In the column subset selection problem (CSSP), we need to minimize the quantity $\|M-SA\|$, where $A$ can be an arbitrary $k\times c$ matrix, and $S$ runs over all $r\times k$ submatrices of $M$. This problem and its applications in numerical linear algebra are being discussed for several decades, but its algorithmic complexity remained an open issue. We show that CSSP is NP-complete.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。