隐集团与限制等距性的证明
Hidden cliques and the certification of the restricted isometry property
摘要:
压缩感知是一种为欠定线性系统寻找稀疏解的技术。该技术依赖于感测矩阵的属性,诸如受限等距属性。满足这一性质的最佳参数的传感矩阵主要是通过概率参数来获得的。判定一个给定的矩阵是否满足约束等距性质是一个非平凡的计算问题。事实上,我们表明,在本文中,限制等距参数不能近似在多项式时间内的任何常数因子的假设下,隐藏的集团问题是困难的。此外,在积极的一面,我们提出了一个改进的暴力枚举算法检查的限制等距属性。
英文摘要:
Compressed sensing is a technique for finding sparse solutions to underdetermined linear systems. This technique relies on properties of the sensing matrix such as the restricted isometry property. Sensing matrices that satisfy this property with optimal parameters are mainly obtained via probabilistic arguments. Deciding whether a given matrix satisfies the restricted isometry property is a non-trivial computational problem. Indeed, we show in this paper that restricted isometry parameters cannot be approximated in polynomial time within any constant factor under the assumption that the hidden clique problem is hard. Moreover, on the positive side we propose an improvement on the brute-force enumeration algorithm for checking the restricted isometry property.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。