arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.08925cs.ITcs.CCmath.IT
收藏

矩阵的一般余火花可在多项式时间内计算

Generic Cospark of a Matrix Can Be Computed in Polynomial Time

Sichen Zhong, Yue Zhao

摘要:

一个矩阵的cospark是稀疏向量在矩阵的列空间中的基数。矩阵余空间的计算是一个NP难问题。给定稀疏模式(即,非零元素的位置),如果非零元素是从独立分布的连续概率分布中抽取的,我们证明了矩阵的cospark以概率1等于称为矩阵的通用cospark的特定数。通用cospark也等于与给定稀疏模式一致的矩阵的最大cospark。我们证明了一个矩阵的通用cospark可以在多项式时间内计算,并提供了一个算法,实现这一点。

英文摘要:

The cospark of a matrix is the cardinality of the sparsest vector in the column space of the matrix. Computing the cospark of a matrix is well known to be an NP hard problem. Given the sparsity pattern (i.e., the locations of the non-zero entries) of a matrix, if the non-zero entries are drawn from independently distributed continuous probability distributions, we prove that the cospark of the matrix equals, with probability one, to a particular number termed the generic cospark of the matrix. The generic cospark also equals to the maximum cospark of matrices consistent with the given sparsity pattern. We prove that the generic cospark of a matrix can be computed in polynomial time, and offer an algorithm that achieves this.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑