Most tensor problems are NP-Hard

Journal of the ACM

Volumn 60, Issue 6, 2013, Pages

  Hillar, Christopher J ^a   Lim, Lek Heng ^b  

^a MATHEMATICAL SCIENCES RESEARCH INSTITUTE   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

P hardness; Bivariate matrix polynomials; Hyperdeterminants; Nonnegative definite tensors; NP hardness; Numerical multilinear algebra; Polynomial time approximation schemes; Symmetric tensors; System of multilinear equations; Tensor eigenvalue; Tensor rank; Tensor singular value; Tensor spectral norm; Undecidability; VNP hardness

Indexed keywords

#P-HARDNESS; EIGEN-VALUE; HYPERDETERMINANTS; MATRIX POLYNOMIALS; MULTI-LINEAR ALGEBRAS; NON NEGATIVES; NP-HARDNESS; POLYNOMIAL TIME APPROXIMATION SCHEMES; SINGULAR VALUES; SPECTRAL NORMS; SYMMETRIC TENSORS; SYSTEM OF MULTILINEAR EQUATIONS; TENSOR RANKS; UNDECIDABILITY; VNP-HARDNESS;

ALGEBRA; APPROXIMATION ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; HARDNESS; POLYNOMIAL APPROXIMATION; SINGULAR VALUE DECOMPOSITION;

TENSORS;

EID: 84891614753     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/2512329     Document Type: Article

References (131)

1. A. A. Ahmadi, A. Olshevsky, P. A. Parrilo, and J. N. Tsitsiklis. 2013. NP-hardness of deciding convexity of quartic polynomials and related problems. Math. Program. Ser. A 137, 1-2, 453-476.
2. M. Aigner. 1995. Tur'an's graph theorem. Amer. Math. Monthly 102, 9, 808-816.
3. E. S. Allman and J. A. Rhodes. 2008. Phylogenetic ideals and varieties for the general Markov model. Adv. Appl. Math. 40, 2, 127-148.
4. N. Alon and A. Naor. 2006. Approximating the cut-norm via Grothendieck's inequality. SIAM J. Comput. 35, 4, 787-803.
5. S. Arora, R. Ge, R. Kannan, and A. Moitra. 2012. Computing a nonnegative matrix factorization - provably. In Proceedings of the ACM Symposium on Theory of Computing (STOC). 145-162.
6. C. Bachoc and F. Vallentin, 2008. New upper bounds for kissing numbers from semidefinite programming. J. Amer. Math. Soc. 21, 3, 909-924.
7. C. Bachoc, G. Nebe, F. M. de Oliveira Filho, and F. Vallentin. 2009. Lower bounds for measurable chromatic numbers. Geom. Funct. Anal. 19, 3, 645-661.
8. S. Banach. 1938. Über homogene polynome in (L2). Studia Math. 7, 1, 36-44.
9. A. I. Barvinok, 1993. Feasibility testing for systems of real quadratic equations. Discrete Comput. Geom. 10, 1, 1-13.
10. A. I. Barvinok. 1995. New algorithms for linear k-matroid intersection and matroid k-parity problems. Math. Prog. 69, 3, 449-470.
11. D. Bayer. 1982. The division algorithm and the Hilbert scheme. Ph.D. thesis, Department of Mathematics, Harvard University.
12. C. Beltrán and L. M. Pardo. 2009. Efficient polynomial system-solving by numerical methods. J. Fixed Point Theory Appl. 6, 1, 63-85
13. E. Bernstein and U. Vazirani. 1997. Quantum complexity theory. SIAM J. Comput. 26, 5, 1411-1473.
14. G. Beylkin and M. J. Mohlenkamp. 2002. Numerical operator calculus in higher dimensions. Proc. Natl. Acad. Sci. 99, 16, 10246-10251.
15. L. Blum, M. Shub, and S. Smale. 1989. On a theory of computation and complexity over the real numbers. Bull. Amer. Math. Soc. 21, 1, 1-46.
16. L. Blum, F. Cucker, M. Shub, and S. Smale. 1998. Complexity and Real Computation. Springer-Verlag, New York.
17. J. Bochnak, M. Coste, and M. F. Roy. 1998. Real Algebraic Geometry 2nd Ed. Ergebnisse der Mathematik und ihrer Grenzgebiete, 36, Springer-Verlag, Berlin.
18. J. Briët, F. M. de Oliveira Filho, and F. Vallentin. 2010a. The positive semidefinite Grothendieck problem with rank constraint. In Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 6198, S. Abramsky et al. Eds., Springer-Verlag, Berlin, 31-42.
19. J. Briët, F.M. de Oliveira Filho, and F. Vallentin. 2010b. Grothendieck inequalities for semidefinite programs with rank constraint. Preprint, http://arxiv.org/abs/1011.1754.
20. S. C. Brubaker and S. S. Vempala. 2009. Random tensors and planted cliques. In Proceedings of APPROX and RANDOM'09, Lecture Notes in Computer Science, vol. 5687, Dinur et al. Eds., Springer-Verlag, Berlin.
21. B. Buchberger. 1970. Ein algorithmisches kriterium für die Lösbarkeit eines algebraischen Gleichungssystems. Aequationes Math. 4, 3, 374-383.
22. P. Bürgisser. 2000. Completeness and reduction in algebraic complexity theory. In Algorithms and Computations in Mathematics, vol. 7, Springer-Verlag, Berlin.
23. P. Bürgisser, M. Clausen, and M. A. Shokrollahi. 1996. Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften, vol. 315, Springer-Verlag, Berlin.
24. D. A. Cartwright and B. Sturmfels. 2013. The number of eigenvalues of a tensor. Linear Algebra Appl. 438, 2, 942-952.
25. D. A. Cartwright, S. M. Brady, D. A. Orlando, B. Sturmfels, and P. N. Benfey. 2009. Reconstructing spatiotemporal gene expression data from partial observations. Bioinform. 25, 19, 2581-2587.
26. A. Cayley. 1845. On the theory of linear transformation. Cambridge Math. J. 4, 193-209.
27. S. Cohen and C. Tomasi. 1997. Systems of bilinear equations. Tech. rep. 97-1588, Department of Computer Science, Stanford University.
28. T. F. Coleman and A. Pothen. 1986. The null space problem I: Complexity. SIAM J. Alg. Disc. Meth. 7, 4, 527-537.
29. P. Comon. 1994. Independent component analysis: A new concept? Signal Process. 36, 3, 287-314.
30. P. Comon. 2004. Blind identification and source separation in 2×3 under-determined mixtures. IEEE Trans. Signal Process. 52, 1, 11-22.
31. P. Comon, G. H. Golub, L.-H. Lim, and B. Mourrain. 2008. Symmetric tensors and symmetric tensor rank. SIAM J. Matrix Anal. Appl. 30, 3, 1254-1279.
32. S. Cook. 1971. The complexity of theorem proving procedures. In Proceedings of the ACM Symposium on the Theory of Computing (STOC). 151-158.
33. R. Coppi and S. Bolasco, Eds. 1989. Multiway Data Analysis. Elsevier Science, Amsterdam, The Netherlands.
34. N. Courtois, L. Goubin, W. Meier, and J.-D. Tacier. 2002. Solving underdefined systems of multivariate quadratic equations. In Proceedings of the Symposium on Public Key Cryptography (PKC'02), Lecture Notes in Computer Science, vol. 2274, D. Naccache and P. Paillier Eds., Springer-Verlag, Berlin.
35. D. A. Cox, J. B. Little, and D. O'Shea. 2005. Using Algebraic Geometry 2nd Ed. Springer-Verlag, New York.
36. D. A. Cox, J. B. Little, and D. O'Shea. 2007. Ideals, Varieties, and Algorithms 3rd Ed. Springer-Verlag, New York, NY.
37. M. Davis, H. Putnam, and J. Robinson. 1961. The decision problem for exponential diophantine equations. Ann. Math. 74, 3, 425-436.
38. M. Davis, Y. Matijasevich, and J. Robinson. 1976. Diophantine equations: Positive aspects of a negative solution. In Mathematical Developments Arising from Hilbert Problems Proceedings of Symposia in Pure Mathematics, vol. 28, AMS, Providence.
39. A. De, P. P. Kurur, C. Saha, and R. Saptharishi. 2008. Fast integer multiplication using modular arithmetic. In Proceedings of the ACM Symposium on the Theory of Computing (STOC). 499-506.
40. E. De Klerk. 2008. The complexity of optimizing over a simplex, hypercube or sphere: A short survey. Cent. Eur. J. Oper. Res. 16, 2, 111-125.
41. E. De Klerk and D. V. Pasechnik. 2002. Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12, 4, 875-892.
42. W. F. De La Vega, R. Kannan, M. Karpinski, and S. Vempala. 2005. Tensor decomposition and approximation schemes for constraint satisfaction problems. In Proceedings of the ACM Symposium on Theory of Computing (STOC). 747-754.
43. J. A. De Loera. 1995. Gröbner bases and graph colorings. Beitr ?age Alg. Geom. 36, 1, 89-96.
44. J. A. De Loera, J. Lee, P. N. Malkin, and S. Margulies. 2008. Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility. In Proceedings of the International Symposium on Symbolic Algebra Computing (ISSAC). 197-206.
45. V. De Silva and L.-H. Lim. 2008. Tensor rank and the ill-posedness of the best low-rank approximation problem. SIAM J. Matrix Anal. Appl. 30, 3, 1084-1127.
46. D. Deutsch. 1985. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. London Ser. A 400, 1818, 97-117.
47. P. J. C. Dickinson and L. Gijben. 2012. On the computational complexity of membership problems for the completely positive cone and its dual. Preprint http://www.optimization-online.org/DBHTML/2011/05/3041.html
48. J. Edmonds. 1967. Systems of distinct representatives and linear algebra. J. Res. Nat. Bur. Standards 71B, 4, 241-245.
49. L. Fortnow. 2009. The status of the P versus NP problem. Commun. ACM 52, 9, 78-86.
50. L. Fortnow and J. Rogers. 1999. Complexity limitations on quantum computation. J. Comput. System Sci. 59, 2, 240-252.
51. P. J. Freitas, S. Friedland, and G. Porta. 2012. Upper bounds on the magnitude of solutions of certain linear systems with integer coefficients. Electron. J. Linear Alg. 24, 113-125.
52. J. Friedman. 1991. The spectra of infinite hypertrees. SIAM J. Comput. 20, 5, 951-961.
53. J. Friedman and A. Wigderson. 1995. On the second eigenvalue of hypergraphs. Combinatorica 15, 1, 43-65.
54. M. Fürer. 2007. Faster integer multiplication. In Proceedings of the ACM Symposium on Theory of Computing (STOC). 57-66.
55. I. M. Gelfand, M. M. Kapranov, and A. V. Zelevinsky. 1992. Hyperdeterminants. Adv. Math. 96, 2, 226-263.
56. I. M. Gelfand,M.M. Kapranov, and A. V. Zelevinsky. 1994. Discriminants, Resultants, and Multidimensional Determinants. Birkhäuser Publishing, Boston, MA.
57. M. X. Goemans and D. P. Williamson. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 6, 1115-1145.
58. G. H. Golub and W. Kahan. 1965. Calculating the singular values and pseudo-inverse of a matrix. J. Soc. Indust. Appl. Math. Ser. B2, 205-224.
59. G. H. Golub and C. Reinsch. 1970. Singular value decomposition and least squares solutions. Numer. Math. 14, 5, 403-420.
60. B. Grenet, P. Koiran, and N. Portier. 2010. The multivariate resultant is NP-hard in any characteristic. In Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, vol. 6281, P. Hliněný and A. Kučera Eds., Springer-Verlag,Berlin
61. L. Gurvits. 2005. On the complexity of mixed discriminants and related problems. In Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 3618, Springer, Berlin, 447-458.
62. V. Halava, T. Harju, and M. Hirvensalo. 2007. Undecidability bounds for integer matrices using Claus instances. Internat. J. Found. Comput. Sci. 18, 5, 931-948.
63. D. Haskell, A. Pillay, and C. Steinhorn, Eds. 2000. Model Theory, Algebra, and Geometry. Mathematical Sciences Research Institute Publications, vol. 39, Cambridge University Press, Cambridge.
64. J. Hastad. 1990. Tensor rank is NP-complete. J. Algor. 11, 4, 644-654.
65. 1-ε. Acta Math. 182, 1, 105-142.
66. S. He, Z. Li, and S. Zhang. 2010. Approximation algorithms for homogeneous polynomial optimization with quadratic constraints. Math. Prog. Ser. B 125, 2, 353-383.
67. J. M. Hendrickx and A. Olshevsky. 2010. Matrix p-norms are NP-hard to approximate if p ≠ 1,2,∞. SIAM J. Matrix Anal. Appl. 31, 5, 2802-2812
68. N. J. Higham. 2002. Accuracy and Stability of Numerical Algorithms 2nd Ed. SIAM, Philadelphia, PA.
69. N. J. Higham. 2008. Functions of Matrices: Theory and Computation. SIAM, Philadelphia, PA.
70. D. Hilbert. 1902. Mathematical problems. Bull. Amer. Math. Soc. 8, 10, 437-479.
71. S. Hill and W. K. Wootters. 1997. Entanglement of a pair of quantum bits. Phys. Rev. Lett. 78, 26, 5022-5025
72. C. Hillar and T. Windfeldt. 2008. Algebraic characterization of uniquely vertex colorable graphs. J. Combin Theory Ser. B 98, 2, 400-414.
73. F. L. Hitchcock. 1927a. The expression of a tensor or a polyadic as a sum of products. J. Math. Phys. 6, 1, 164-189.
74. F. L. Hitchcock. 1927b. Multiple invariants and generalized rank of a p-way matrix or tensor. J. Math. Phys. 7, 1, 39-79.
75. D. S. Hochbaum, Ed. 1997. Approximation Algorithms for NP-Hard Problems. PWS Publishing, Boston, MA.
76. D. S. Hochbaum and J. G. Shanthikumar. 1990. Convex separable optimization is not much harder than linear optimization. J. ACM 37, 4, 843-862.
77. P. Huggins, B. Sturmfels, J. Yu, and D. S. Yuster. 2008. The hyperdeterminant and triangulations of the 4-cube. Math. Comp. 77, 263, 1653-1679.
78. J. P. Jones. 1982. Universal Diophantine equation. J. Symb. Logic 47, 3, 549-571.
79. J. P. Jones and Y. V. Matijasevič. 1984. Register machine proof of the theorem on exponential Diophantine representation of enumerable sets. J. Symb. Logic 49, 3, 818-829.
80. W. Kahan. 1997. IEEE Standard 754 for Binary Floating-Point Arithmetic. http://www.cs.berkeley.edu/~wkahan/ieee754status/ieee754.ps, Berkeley, CA
81. R. M. Karp. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher Eds., Plenum, New York.
82. L. G. Khachiyan. 1979. A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR 244, 5, 1093-1096. (English translation in Soviet Math. Dokl. 20, 1, 191-194).
83. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. 2007. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput. 37, 1, 319-357.
84. D. Kressner. 2013. Bivariate matrix functions. Oper. Matrices, to appear.
85. D. E. Knuth. 1974a. A terminology proposal. SIGACT News 6, 1, 12-18.
86. D. E. Knuth. 1974b. Postscript about NP-hard problems. SIGACT News 6, 2, 15-16.
87. D. E. Knuth. 1998. The Art of Computer Programming, 2: Seminumerical Algorithms 3rd Ed. Addision- Wesley, Reading, MA.
88. E. Kofidis and P. A. Regalia. 2001/2002. On the best rank-1 approximation of higher-order supersymmetric tensors. SIAM J. Matrix Anal. Appl. 23, 3, 863-884.
89. J. M. Landsberg. 2012. Tensors: Geometry and Applications. AMS, Providence, RI.
90. L. A. Levin. 1973. Universal sequential search problems. Probl. Inf. Transm. 9, 3, 265-266.
91. L.-H. Lim. 2005. Singular values and eigenvalues of tensors: A variational approach. In Proceedings of the IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Process (CAMSAP). 129-132.
92. L.-H. Lim. 2013. Tensors and hypermatrices. In Handbook of Linear Algebra 2nd Ed. L. Hogben Ed., CRC Press, Boca Raton, FL.
93. L.-H. Lim and T. Schultz. 2013. Moment tensors and high angular resolution diffusion imaging. Preprint
94. L. Lovász. 1994. Stable sets and polynomials. Disc. Math. 124, 1-3, 137-153.
95. Y. V. Matijasevič. 1970. The Diophantineness of enumerable sets. Dokl. Akad. Nauk SSSR 191, 2, 279-282, (English translation in Soviet Math. Dokl. 11, 2, 354-358.)
96. Y. V. Matijasevič. 1993. Hilbert's Tenth Problem. MIT Press, Cambridge, MA.
97. A. Miyake and M. Wadati. 2002. Multipartite entanglement and hyperdeterminants. Quant. Inf. Comput. 2, 540-555.
98. T. Motzkin and E. G. Straus. 1965. Maxima for graphs and a new proof of a theorem of Turán. Canad. J. Math. 17, 533-540.
99. K. G. Murty and S. N. Kabadi. 1987. Some NP-complete problems in quadratic and nonlinear programming. Math. Prog. 39, 2, 117-129.
100. B. K. Natarajan. 1995. Sparse approximate solutions to linear systems. SIAM J. Comput. 24, 2, 227-234.
101. Yu. Nesterov. 2003. Random walk in a simplex and quadratic optimization over convex polytopes. Preprint. http://edoc.bib.ucl.ac.be:83/archive/00000238/ 01/dp2003-71.pdf
102. G. Ni, L. Qi, F. Wang, and Y. Wang. 2007. The degree of the E-characteristic polynomial of an even order tensor. J. Math. Anal. Appl. 329, 2, 1218-1229.
103. M. L. Overton. 2001. Numerical Computing with IEEE Floating Point Arithmetic. SIAM, Philadelphia, PA.
104. A. Pappas, Y. Sarantopoulos, and A. Tonge. 2007. Norm attaining polynomials. Bull. Lond. Math. Soc. 39, 2, 255-264.
105. B. Poonen. 2002. Undecidable problems: A sampler. http://arxiv.org/abs/ 1204.0299
106. B. Poonen. 2003. Hilbert's tenth problem and Mazur's conjecture for large subrings of Q. J. AMS 16, 4, 981-990.
107. L. Qi. 2007. Eigenvalues and invariants of tensors. J. Math. Anal. Appl. 325, 2, 1363-1377.
108. L. Qi. 2005. Eigenvalues of a real supersymmetric tensor. J. Symb. Comput. 40, 6, 1302-1324.
109. B. Reznick. 1992. Sums of even powers of real linear forms. Mem. Amer. Math. Soc. 96, 463.
110. B. Reznick. 2013. On the length of binary forms. In Quadratic and Higher Degree Forms, Developments in Mathematics, K. Alladi, M. Bhargava, D. Savitt, and P. Tiep Eds., Springer, New York. http://arxiv.org/abs/1007.5485.
111. T. Schultz and H.-P. Seidel. 2008. Estimating crossing fibers: A tensor decomposition approach. IEEE Trans. Vis. Comput. Graphics 14, 6, 1635-1642.
112. A. Shashua and T. Hazan. 2005. Non-negative tensor factorization with applications to statistics and computer vision. In Proceedings of the International Conference on Machine Learning (ICML). 792-799.
113. J. Shi and J. Malik. 2000. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22, 8, 888-905.
114. N. D. Sidiropoulos, R. Bro, and G. B. Giannakis. 2000. Parallel factor analysis in sensor array processing. IEEE Trans. Signal Process. 48, 8, 2377-2388.
115. M. Sipser. 2012. Introduction to the Theory of Computation 3rd Ed., Cengage Learning, Boston, MA.
116. S. Smale. 2000. Mathematical problems for the next century. In Mathematics: Frontiers and Perspectives, V. Arnold, M. Atiyah, P. Lax, and B. Mazur Eds., AMS, Providence, RI.
117. A. Smilde, R. Bro, and P. Geladi. 2004. Multi-Way Analysis: Applications in the Chemical Sciences. John Wiley, West Sussex.
118. D. Steinberg. 2005. Computation of Matrix Norms with Applications to Robust Optimization, M.Sc. dissertation, Technion, Haifa, Israel.http://www2. isye.gatech.edu/~nemirovs/Daureen.pdf
119. A. M. Turing. 1937. On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 2nd Series 42, 1, 230-265. (see also correction in 43, 6, 544-546.)
120. L. G. Valiant. 1979a. Completeness classes in algebra. In Proceedings of the ACM Symposium on Theory of Computing (STOC). 249-261.
121. L. G. Valiant. 1979b. The complexity of computing the permanent. Theoret. Comput. Sci. 8, 2, 189-201.
122. M. A. O. Vasilescu. 2002. Human motion signatures: Analysis, synthesis, recognition. In Proceedings of the International Conference on Pattern Recognition (ICPR), 456-460.
123. M. A. O. Vasilescu and D. Terzopoulos. 2002. Multilinear image analysis for facial recognition. In Proceedings of the International Conference on Pattern Recognition (ICPR), 511-514.
124. M. A. O. Vasilescu and D. Terzopoulos. 2004. TensorTextures: Multilinear image-based rendering. In Proceedings of ACM SIGGRAPH. 336-342.
125. S. A. Vavasis. 1991. Nonlinear Optimization: Complexity Issues. International Series of Monographs on Computer Science, Oxford University Press.
126. S. A. Vavasis. 2009. On the complexity of nonnegative matrix factorization. SIAM J. Optim. 20, 3, 1364-1377.
127. V. Vazirani. 2003. Approximation Algorithms. Springer-Verlag, Berlin.
128. T.-C. Wei and P. M. Goldbart. 2003. Geometric measure of entanglement and applications to bipartite and multipartite quantum states. Phys. Rev. A 68, 4, 042307-1-12.
129. K. Weihrauch. 2000. Computable Analysis: An Introduction. Springer-Verlag, Berlin.
130. C. K. Yap. 2000. Fundamental Problems of Algorithmic Algebra. Oxford University Press.
131. D. Zuckerman. 2006. Linear degree extractors and the inapproximability of max clique and chromatic number. In Proceedings of the ACM Symposium on Theory of Computing (STOC). 681-690.