Most Tensor Problems Are NP-Hard 1: Graph 3-Colorability Reduces to Deciding Whether 0 Is an Eigenvalue of a Rational 3-Tensor over the RealsResearch Paper
Eigenvalues of matrices are computable in polynomial time to any accuracy, and numerical linear algebra rests on that fact. Higher-order tensors appear in statistics (moment and cumulant tensors), signal processing, quantum information and polynomial optimization, and several notions of tensor eigenvalue were proposed for them, independently by Lim and by…