Most Tensor Problems Are NP-Hard 3: The Clique Number Is the Unique l for Which an Explicit Graph Tensor Has Spectral Norm 1Research Paper
The spectral norm of a matrix, its largest singular value, is computable in polynomial time to any accuracy. Its analogue for 3-tensors appears in the analysis of multilinear systems, in the best rank-1 approximation of a data array, in quantum information (the geometric measure of entanglement), and in the injective norm of tensor products. Hillar and Lim, …