Most Tensor Problems Are NP-Hard
Publication:5395740
DOI10.1145/2512329zbMath1281.68126DBLPjournals/jacm/HillarL13arXiv0911.1393OpenAlexW2079705627WikidataQ60307003 ScholiaQ60307003MaRDI QIDQ5395740
Lek-Heng Lim, Christopher J. Hillar
Publication date: 17 February 2014
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.1393
undecidabilitysymmetric tensorsNP-hardnesshyperdeterminantstensor ranktensor eigenvaluepolynomial time approximation schemes\#P-hardnessnumerical multilinear algebratensor spectral normtensor singular valuebivariate matrix polynomialsnonnegative definite tensorssystem of multilinear equationsVNP-hardness
Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (only showing first 100 items - show all)
This page was built for publication: Most Tensor Problems Are NP-Hard