矩阵P-模是NP-难逼近的,如果p \neq 1,2,\infty
Matrix P-norms are NP-hard to approximate if p \neq 1,2,\infty
摘要:
我们证明了对于除p = 1,2之外的任意有理p \in [1,\infty),除非P = NP,否则没有多项式时间算法来逼近矩阵p-范数到任意相对精度.我们还表明,对于任何有理\in [1,\infty),包括p = 1,2,除非P = NP,没有多项式时间算法近似的\infty,p混合范数到一些固定的相对精度。
英文摘要:
We show that for any rational p \in [1,\infty) except p = 1, 2, unless P = NP, there is no polynomial-time algorithm for approximating the matrix p-norm to arbitrary relative precision. We also show that for any rational p\in [1,\infty) including p = 1, 2, unless P = NP, there is no polynomial-time algorithm approximates the \infty, p mixed norm to some fixed relative precision.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。