The DOI matches its Crossref record; 94 of the 94 references it cites were found in a registry or an index.
Most Tensor Problems Are NP-Hard
Abstract
We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list 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 is NP-, #P-, and VNP-hard.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,320
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
Independent component analysis, A new concept?
Comon, P. (1994) · Signal Processing · doi:10.1016/0165-1684(94)90029-9 · Cited by 8,205
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
Taussky, O., & Knuth, D. E. (1970) · The American Mathematical Monthly · doi:10.2307/2317055 · Cited by 3,822
Accuracy and Stability of Numerical Algorithms: Second Edition
Higham, N. J. (2002) · doi:10.1137/1.9780898718027 · Cited by 3,803
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
(2011) · SpringerReference · doi:10.1007/springerreference_57547 · Cited by 3,190
Approximation Algorithms for NP-Hard Problems
(1997) · ACM SIGACT News · doi:10.1145/261342.571216 · Cited by 3,103
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929
Entanglement of a pair of quantum bits
Hill, S., & Wootters, W. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.5022 · Cited by 2,823
Introduction to the Theory of Computation
Sipser, M. (1996) · ACM SIGACT News · doi:10.1145/230514.571645 · Cited by 2,784
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Discriminants, Resultants, and Multidimensional Determinants
Gelfand, I. M., Kapranov, M. M., & Zelevinsky, A. V. (1994) · Birkhäuser Boston eBooks · doi:10.1007/978-0-8176-4771-1 · Cited by 2,306
Functions of Matrices: Theory and Computation
Higham, N. J. (2008) · doi:10.1137/1.9780898717778 · Cited by 2,113
Polynomial algorithms in linear programming
Khachiyan, L. G. (1980) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(80)90061-0 · Cited by 1,992
Calculating the Singular Values and Pseudo-Inverse of a Matrix
Golub, G., & Kahan, W. (1965) · Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis · doi:10.1137/0702016 · Cited by 1,786
Bochnak, J., Coste, M., & Roy, M.-F. (1998) · Springer · doi:10.1007/978-3-662-03718-8 · Cited by 1,538
Bernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
Eigenvalues of a real supersymmetric tensor
Qi, L. (2005) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2005.05.007 · Cited by 1,440
Reducibility Among Combinatorial Problems
Rarp, K. (2012) · Cited by 1,390
Clique is hard to approximate within n1−ε
Håstad, J. (1999) · Acta Mathematica · doi:10.1007/bf02392825 · Cited by 1,369
The Expression of a Tensor or a Polyadic as a Sum of Products
Hitchcock, F. L. (1927) · Journal of Mathematics and Physics · doi:10.1002/sapm192761164 · Cited by 1,345
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Complexity and real computation
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6275c · Cited by 1,228
Mathematical problems for the next century
Smale, S. (1998) · The Mathematical Intelligencer · doi:10.1007/bf03025291 · Cited by 1,217
Hilbert, D. (1902) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1902-00923-3 · Cited by 1,182
Multi‐Way Analysis with Applications in the Chemical Sciences
Smilde, A., Bro, R., & Geladi, P. (2004) · Wiley eBooks · doi:10.1002/0470012110 · Cited by 1,176
Blum, L., Shub, M., & Smale, S. (1989) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1989-15750-9 · Cited by 1,056
Bürgisser, P., Clausen, M., & Shokrollahi, M. A. (1997) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-03338-8 · Cited by 1,026
Some NP-complete problems in quadratic and nonlinear programming
Murty, K. G., & Kabadi, S. N. (1987) · Mathematical Programming · doi:10.1007/bf02592948 · Cited by 1,003
Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
de Silva, V., & Lim, L.-H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/06066518x · Cited by 927
Self-citationComplexity and Real Computation
Blum, L., Cucker, F., Shub, M., & Smale, S. (1998) · Springer eBooks · doi:10.1007/978-1-4612-0701-6 · Cited by 869
Cox, D., Little, J., & O’Shea, D. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-6911-1 · Cited by 816
Singular Values and Eigenvalues of Tensors: A Variational Approach
Lim, L. (2006) · IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing · doi:10.1109/camap.2005.1574201 · Cited by 789
Self-citationComputable Analysis : An Introduction
Weihrauch, K. (2014) · CERN Document Server (European Organization for Nuclear Research) · Cited by 762
Geometric measure of entanglement and applications to bipartite and multipartite quantum states
Wei, T.-C., & Goldbart, P. M. (2003) · Physical Review A · doi:10.1103/physreva.68.042307 · Cited by 742
Vazirani, V. V. (2003) · Springer eBooks · doi:10.1007/978-3-662-04565-7 · Cited by 716
Maxima for Graphs and a New Proof of a Theorem of Turán
Motzkin, T. S., & Straus, E. G. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-053-6 · Cited by 710
Tensors: Geometry and Applications
Landsberg, J. (2011) · Graduate Studies in Mathematics · doi:10.1090/gsm/128 · Cited by 623
On the Complexity of Nonnegative Matrix Factorization
Vavasis, S. A. (2010) · SIAM Journal on Optimization · doi:10.1137/070709967 · Cited by 588
Håstad, J. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90014-6 · Cited by 584
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
Khot, S., Kindler, G., Mossel, E., & O’Donnell, R. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447372 · Cited by 578
Symmetric Tensors and Symmetric Tensor Rank
Comon, P., Golub, G., Lim, L.-H., & Mourrain, B. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/060661569 · Cited by 544
Self-citationNon-negative tensor factorization with applications to statistics and computer vision
Shashua, A., & Hazan, T. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102451 · Cited by 490
Completeness Classes in Algebra
Valiant, L. G. (1979) · ACM eBooks · doi:10.1145/3749740.3749750 · Cited by 465
Rank-One Approximation to High Order Tensors
Zhang, T., & Golub, G. H. (2001) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479899352045 · Cited by 430
Linear degree extractors and the inapproximability of max clique and chromatic number
Zuckerman, D. (2006) · Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/1132516.1132612 · Cited by 398
On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
Kofidis, E., & Regalia, P. A. (2002) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479801387413 · Cited by 387
Multiple Invariants and Generalized Rank of a P‐Way Matrix or Tensor
Hitchcock, F. L. (1928) · Journal of Mathematics and Physics · doi:10.1002/sapm19287139 · Cited by 338
Approximation of the Stability Number of a Graph via Copositive Programming
de Klerk, E., & Pasechnik, D. V. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623401383248 · Cited by 322
The status of the P versus NP problem
Fortnow, L. (2009) · Communications of the ACM · doi:10.1145/1562164.1562186 · Cited by 321
Numerical Computing with IEEE Floating Point Arithmetic
Overton, M. L. (2001) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718072 · Cited by 302
Coppi, R., & Bolasco, S. (1989) · Medical Entomology and Zoology · Cited by 285
Computing a nonnegative matrix factorization -- provably
Arora, S., Ge, R., Kannan, R., & Moitra, A. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2213994 · Cited by 280
The division algorithm and the hilbert scheme
Bayer, D. A. (1982) · Harvard University eBooks · Cited by 251
Fürer, M. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250800 · Cited by 240
Multilinear image analysis for facial recognition
Vasilescu, M. A. O., & Terzopoulos, D. (2003) · Object recognition supported by user interaction for service robots · doi:10.1109/icpr.2002.1048350 · Cited by 229
Approximating the Cut-Norm via Grothendieck's Inequality
Alon, N., & Naor, A. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704441629 · Cited by 222
The number of eigenvalues of a tensor
Cartwright, D., & Sturmfels, B. (2011) · Linear Algebra and its Applications · doi:10.1016/j.laa.2011.05.040 · Cited by 210
Complexity of Computer Computations
Rice, J. R., Miller, R. E., & Thatcher, J. W. (1974) · Mathematics of Computation · doi:10.2307/2005950 · Cited by 205
Completeness and Reduction in Algebraic Complexity Theory
Bürgisser, P. (2000) · Algorithms and Computation in Mathematics · doi:10.1007/978-3-662-04179-6 · Cited by 189
Complexity Limitations on Quantum Computation
Fortnow, L., & Rogers, J. (1999) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1651 · Cited by 168
TensorTextures: multilinear image-based rendering
Vasilescu, M. A. O., & Terzopoulos, D. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015725 · Cited by 167
Phylogenetic ideals and varieties for the general Markov model
Allman, E. S., & Rhodes, J. A. (2008) · Advances in Applied Mathematics · doi:10.1016/j.aam.2006.10.002 · Cited by 164
On the computational complexity of membership problems for the completely positive cone and its dual
Dickinson, P. J. C., & Gijben, L. (2013) · Computational Optimization and Applications · doi:10.1007/s10589-013-9594-z · Cited by 159
Estimating Crossing Fibers: A Tensor Decomposition Approach
Schultz, T., & Seidel, H. (2008) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2008.128 · Cited by 139
Human motion signatures: analysis, synthesis, recognition
Vasilescu, M. A. O. (2003) · doi:10.1109/icpr.2002.1047975 · Cited by 134
NP-hardness of deciding convexity of quartic polynomials and related problems
Ahmadi, A. A., Olshevsky, A., Parrilo, P. A., & Tsitsiklis, J. N. (2011) · Mathematical Programming · doi:10.1007/s10107-011-0499-2 · Cited by 126
Matrix p -Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$
Hendrickx, J. M., & Olshevsky, A. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/09076773x · Cited by 107
Postscript about NP-hard problems
Knuth, D. E. (1974) · ACM SIGACT News · doi:10.1145/1008304.1008305 · Cited by 98
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
He, S., Li, Z., & Zhang, S. (2010) · Mathematical Programming · doi:10.1007/s10107-010-0409-z · Cited by 91
The complexity of optimizing over a simplex, hypercube or sphere: a short survey
de Klerk, E. (2007) · Central European Journal of Operations Research · doi:10.1007/s10100-007-0052-9 · Cited by 89
Lim, L. (2013) · Discrete mathematics and its applications · doi:10.1201/b16113-19 · Cited by 85
Self-citationSolving Underdefined Systems of Multivariate Quadratic Equations
Courtois, N. T., Goubin, L., Meier, W., & Tacier, J.-D. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45664-3_15 · Cited by 80
Fast Integer Multiplication Using Modular Arithmetic
De, A., Kurur, P. P., Saha, C., & Saptharishi, R. (2008) · SIAM Journal on Computing · doi:10.1137/100811167 · Cited by 76
Hilbert’s Tenth Problem and Mazur’s Conjecture for large subrings of ℚ
Poonen, B. (2003) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-03-00433-8 · Cited by 64
Undecidable problems: a sampler
Poonen, B. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9780511756306.015 · Cited by 63
Gelfand, I. M., Kapranov, M. M., & Zelevinsky, A. V. (1992) · Advances in Mathematics · doi:10.1016/0001-8708(92)90056-q · Cited by 61
The hyperdeterminant and triangulations of the 4-cube
Huggins, P. M., Sturmfels, B., Yu, J., & Yuster, D. S. (2008) · Mathematics of Computation · doi:10.1090/s0025-5718-08-02073-5 · Cited by 58
Grothendieck inequalities for semidefinite programs with rank constraint
Briët, J., Filho, F. M. D. O., & Vallentin, F. (2014) · Theory of Computing · doi:10.4086/toc.2014.v010a004 · Cited by 58
On the Complexity of Mixed Discriminants and Related Problems
Gurvits, L. (2005) · Lecture notes in computer science · doi:10.1007/11549345_39 · Cited by 54
Multipartite entanglement and hyperdeterminants
Miyake, A., & Wadati, M. (2002) · Quantum Information and Computation · doi:10.26421/qic2.s-4 · Cited by 53
Knuth, D. E. (1974) · ACM SIGACT News · doi:10.1145/1811129.1811130 · Cited by 44
TensorTextures: multilinear image-based rendering
Vasilescu, M. A. O., & Terzopoulos, D. (2004) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/1186562.1015725 · Cited by 36
The Spectra of Infinite Hypertrees
Friedman, J. (1991) · SIAM Journal on Computing · doi:10.1137/0220058 · Cited by 17
The Multivariate Resultant Is NP-hard in Any Characteristic
Grenet, B., Koiran, P., & Portier, N. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15155-2_42 · Cited by 12
Efficient polynomial system-solving by numerical methods
Beltrán, C., & Pardo, L. M. (2009) · Journal of Fixed Point Theory and Applications · doi:10.1007/s11784-009-0113-x · Cited by 7
Cited by
Tensor Decomposition for Signal Processing and Machine Learning
Sidiropoulos, N. D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E. E., & Faloutsos, C. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2690524 · Cited by 1,617
Tensor Robust Principal Component Analysis with a New Tensor Nuclear Norm
Lu, C., Feng, J., Chen, Y., Liu, W., Lin, Z., & Yan, S. (2020) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2891760 · Cited by 1,144
Tensor decompositions for learning latent variable models
(2012) · arXiv (Cornell University) · doi:10.5555/2627435.2697055 · Cited by 779
Infrared Small Target Detection Based on Partial Sum of the Tensor Nuclear Norm
Zhang, L., & Peng, Z. (2019) · Remote Sensing · doi:10.3390/rs11040382 · Cited by 759
Quantum machine learning: a classical perspective
Ciliberto, C., Herbster, M., Ialongo, A. D., Pontil, M., Rocchetto, A., Severini, S., & Wossnig, L. (2018) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2017.0551 · Cited by 518
Metadata
- Authors
- Hillar, C. J., & Lim, L.-H.
- Venue
- Journal of the ACM
- Published
- 2013-11
- Volume
- 60
- Issue
- 6
- Pages
- 1-39
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2079705627
- Cited by
- 1,099
- References
- 94
- FWCI
- 16.25
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.