No article text was recorded for this version.
tensor rank NP-hardness
Version 2 of 2198 papers248 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Most Tensor Problems Are NP-Hard
- Blog: Finding the smallest or largest element of a tensor from its low-rank factors
- Blog: Most tensor problems are NP hard
- Blog: On decomposability and subdifferential of the tensor nuclear norm
- Blog: Tensor Decomposition for Signal Processing and Machine Learning
- Blog: Optimal orthogonal approximations to symmetric tensors cannot always be chosen symmetric
- Blog: Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory
- Blog: Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
- Blog: Ergodicity Coefficients for Higher-Order Stochastic Processes
- Blog: Computing Tensor Eigenvalues: Theory and Practice.
- Blog: Scalable and Sound Low-Rank Tensor Learning
- Blog: Random Tensors and Planted Cliques
- Blog: <inline-formula><tex-math id="M1">\begin{document}$ Z $\end{document}</tex-math></inline-formula>-eigenvalue exclusion theorems for tensors
- Blog: Minimum (maximum) rank of tensors and the sign nonsingular tensors
- Blog: Low rank tensor recovery via iterative hard thresholding
- Blog: Tensor Decompositions for Signal Processing Applications: From two-way to multiway component analysis
- Blog: Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems
- Blog: A Variational Characterization and A Line Search Newton-Noda Method for the unifying spectral problem of nonnegative tensors
- Blog: Introduction to Tensor Decompositions and their Applications in Machine Learning
- Blog: Tensor vs. Matrix Methods: Robust Tensor Decomposition under Block Sparse Perturbations
- Blog: On the minimal ranks of matrix pencils and the existence of a best approximate block-term tensor decomposition
- Blog: Guaranteed Tensor Decomposition: A Moment Approach
- Blog: A Novel Non-Iterative Algorithm For Low-Multilinear-Rank Tensor Approximation
- Blog: The border support rank of two-by-two matrix multiplication is seven
- Blog: Random Tensors and Planted Cliques
- Blog: Random Tensor Theory for Tensor Decomposition
- Blog: Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?
- Blog: On the Connection Between Learning Two-Layers Neural Networks and Tensor Decomposition
- Blog: Tensor principal component analysis via convex optimization
- Blog: On the compressibility of tensors
- Blog: An orthogonal equivalence theorem for third order tensors
- Blog: Hermitian Tensor Decompositions
- Blog: Operator norm inequalities between tensor unfoldings on the partition lattice
- Blog: Dehomogenization for completely positive tensors
- Blog: Tensor Decomposition for Signal Processing and Machine Learning
- Blog: Efficient tensor completion: Low-rank tensor train
- Blog: Tensor Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Tensors via Convex Optimization
- Blog: Dominant Z-Eigenpairs of Tensor Kronecker Products are Decoupled and Applications to Higher-Order Graph Matching
- Blog: An efficient tree decomposition method for permanents and mixed discriminants
- Blog: A QR Algorithm for Symmetric Tensors
- Blog: Greedy Algorithms for Structurally Constrained High Dimensional Problems
- Blog: Shifted power method for computing tensor eigenpairs.
- Blog: Certifying Random Polynomials over the Unit Sphere via Sum of Squares Hierarchy
- Blog: Diversifying Message Aggregation in Multi-Agent Communication Via Normalized Tensor Nuclear Norm Regularization
- Blog: On orthogonal tensors and best rank-one approximation ratio
- Blog: Quantum Machine Learning Algorithm for Knowledge Graphs
- Blog: Putting MRFs on a Tensor Train
- Blog: Tensor Sandwich: Tensor Completion for Low CP-Rank Tensors via Adaptive Random Sampling
- Blog: Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling
- Blog: Orthogonal Tensor Decompositions via Two-Mode Higher-Order SVD (HOSVD)
- Blog: Positive Semi-Definite Hankel Tensors
- Blog: Tensor rank bounds for point singularities in ℝ3
- Blog: Sum-of-squares meets square loss: Fast rates for agnostic tensor completion
- Blog: The arithmetic complexity of tensor contractions
- Blog: Globally Convergent Jacobi-Type Algorithms for Simultaneous Orthogonal Symmetric Tensor Diagonalization
- Blog: Tensor and its tucker core: The invariance relationships
- Blog: Kernelized support tensor train machines
- Blog: Robust Low-Tubal-Rank Tensor Completion via Convex Optimization
- Blog: Robust Eigenvectors of Regular Simplex Tensors: Conjecture Proof
- Blog: Towards LLM-guided Efficient and Interpretable Multi-linear Tensor Network Rank Selection
Showing 60 of 198 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_tensor_rank_np_hardness_87c8a9a1,
title = {tensor rank NP-hardness},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/tensor-rank-np-hardness/rdr_87c8a9a1b2574742b89fa1a817d05d26},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_tensor_rank_np_hardness_87c8a9a1_v2,
title = {tensor rank NP-hardness},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/tensor-rank-np-hardness/rdr_87c8a9a1b2574742b89fa1a817d05d26/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}