大多数张量问题都是NP困难的
Most tensor problems are NP-hard
摘要:
我们证明了数值线性代数中许多有效可计算问题的多线性(张量)类似物是NP-困难的。我们的清单包括:确定双线性方程组的可行性,决定3-张量是否具有给定的本征值、奇异值或谱范数;近似本征值、本征向量、奇异向量或谱范数;以及确定3-张量的秩或最佳秩-1近似。此外,我们表明,限制这些问题的对称张量并没有减轻他们的NP-硬度。我们还解释了如何决定对称4-张量的非负定性是NP-困难的,以及如何计算4-张量的组合超行列式是NP-,#P-和VNP-困难的。我们将认为,我们的结果提供了另一种观点的边界分离的线性/凸问题的计算易处理性的棘手的非线性/非凸的。
英文摘要:
We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor possesses a given eigenvalue, singular value, or spectral norm; approximating an eigenvalue, eigenvector, singular vector, or the spectral norm; and determining the rank or best rank-1 approximation of a 3-tensor. Furthermore, we show that restricting these problems to symmetric tensors does not alleviate their NP-hardness. We also explain how deciding nonnegative definiteness of a symmetric 4-tensor is NP-hard and how computing the combinatorial hyperdeterminant of a 4-tensor is NP-, #P-, and VNP-hard. We shall argue that our results provide another view of the boundary separating the computational tractability of linear/convex problems from the intractability of nonlinear/nonconvex ones.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。