Tensor rank is NP-complete
From MaRDI portal
Publication:3203928
Recommendations
- The complexity of tensor rank
- On the complexity of finding tensor ranks
- Tensor rank is hard to approximate
- scientific article; zbMATH DE number 7387190
- Bounds on the tensor rank
- An upper bound for the tensor rank
- Tensor decompositions and rank increment conjecture
- Tensor decompositions in rank \(+1\)
- Matrix completion and tensor rank
- Most tensor problems are NP-hard
Cited in
(only showing first 100 items - show all)- Tripartite-to-bipartite entanglement transformation by stochastic local operations and classical communication and the structure of matrix spaces
- Matrix completion and tensor rank
- Several remarks on tensor rank computation
- The average condition number of most tensor rank decomposition problems is infinite
- A spectral theory for tensors
- Exponential family tensor completion with auxiliary information
- Finding a low-rank basis in a matrix subspace
- Rapid solution of problems by quantum computation
- Tripartite Entanglement Transformations and Tensor Rank
- The power of tensor-based approaches in cardiac applications
- Hankel Tensor Decompositions and Ranks
- Numerical tensor calculus
- An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
- A note on the gap between rank and border rank
- Matrix pencils and entanglement classification
- Robust and resource-efficient identification of two hidden layer neural networks
- Tensorized low-rank circulant preconditioners for multilevel Toeplitz linear systems from high-dimensional fractional Riesz equations
- Well-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations
- An inexact continuation accelerated proximal gradient algorithm for low \textit{n}-rank tensor recovery
- Tensor representation of rank-metric codes
- On decompositions of complete hypergraphs
- Nonnegative tensor decomposition with custom clustering for microphase separation of block copolymers
- Partition arguments in multiparty communication complexity
- Low permutation-rank matrices: structural properties and noisy completion
- scientific article; zbMATH DE number 5269047 (Why is no real title available?)
- The border support rank of two-by-two matrix multiplication is seven
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- Computing dense tensor decompositions with optimal dimension trees
- A general theory of singular values with applications to signal denoising
- Cayley's hyperdeterminant: A combinatorial approach via representation theory
- On the equivalence between low-rank matrix completion and tensor rank
- On the Compressibility of Tensors
- On the optimization landscape of tensor decompositions
- Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
- scientific article; zbMATH DE number 7387190 (Why is no real title available?)
- The tensor rank of semifields of order 16 and 81
- Classifying entanglement by algebraic geometry
- Improved method for finding optimal formulas for bilinear maps in a finite field
- Tensor theta norms and low rank recovery
- Pencil-based algorithms for tensor rank decomposition are not stable
- Tensor network alternating linear scheme for MIMO Volterra system identification
- Entanglement transformation between ensembles of three-qubit GHZ-type states by LOCC
- Strassen's rank additivity for small tensors, including tensors of rank less or equal 7
- Rank of a tensor and quantum entanglement
- Constructive representation of functions in low-rank tensor formats
- A note on the ranks of \(2\times 2\times 2\) and \(2\times 2\times 2\times 2\) tensors
- A numerical solver for high dimensional transient Fokker-Planck equation in modeling polymeric fluids
- The complexity of tensor rank
- scientific article; zbMATH DE number 7758331 (Why is no real title available?)
- On the rank of a Latin tensor
- Tucker tensor analysis of Matérn functions in spatial statistics
- Smoothed analysis for tensor methods in unsupervised learning
- On the nuclear norm and the singular value decomposition of tensors
- Tensor surgery and tensor rank
- An introduction to the computational complexity of matrix multiplication
- Augmented Lagrangian method for tensor low-rank and sparsity models in multi-dimensional image recovery
- Bounding the separable rank via polynomial optimization
- On the representation of symmetric and antisymmetric tensors
- Solution of linear systems in high spatial dimensions
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
- Interpolatory tensorial reduced order models for parametric dynamical systems
- An iterative algorithm for third-order tensor multi-rank minimization
- An Adaptive Sampling Strategy for Online Monitoring and Diagnosis of High-Dimensional Streaming Data
- Non-minimum tensor rank Gabidulin codes
- Low rank tensor recovery via iterative hard thresholding
- Algebraic methods for tensor data
- A fast alternating least squares method for third-order tensors based on a compression procedure
- Tensor representation of non-linear models using cross approximations
- Entanglement manipulation beyond local operations and classical communication
- An approximation method of CP rank for third-order tensor completion
- Tucker factorization with missing data with application to low-n-rank tensor completion
- Tensor networks for MIMO LPV system identification
- Tensor rank is hard to approximate
- More on Tensors with Different Rank and Symmetric Rank
- Numerical tensor techniques for multidimensional convolution products
- Tensor Mixed Effects Model With Application to Nanomanufacturing Inspection
- The G-stable rank for tensors and the cap set problem
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- Logic minimization techniques with applications to cryptology
- General linear group action on tensors: a candidate for post-quantum cryptography
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
- Comon's conjecture, rank decomposition, and symmetric rank decomposition of symmetric tensors
- Robust tensor recovery with nonconvex and nonsmooth regularization
- Barriers for rank methods in arithmetic complexity
- Low rank interpolation of boundary spline curves
- Optimization on the Euclidean unit sphere
- Generating hidden Markov models from process models through nonnegative tensor factorization
- Random arithmetic formulas can be reconstructed efficiently
- Tensor completion in hierarchical tensor representations
- Numerical solution of high dimensional stationary Fokker-Planck equations via tensor decomposition and Chebyshev spectral differentiation
- Truncation of tensors in the hierarchical format
- Monotonically convergent algorithms for symmetric tensor approximation
- A splitting augmented Lagrangian method for low multilinear-rank tensor recovery
- \((L_r,L_r,1)\)-decompositions, sparse component analysis, and the blind separation of sums of exponentials
- Imbalanced low-rank tensor completion via latent matrix factorization
- Internet traffic tensor completion with tensor nuclear norm
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme
- Joint Tensor Modeling of Single Cell 3D Genome and Epigenetic Data with Muscle
- The LSQR method for solving tensor least-squares problems
- A public key cryptosystem based on data complexity under quantum environment
This page was built for publication: Tensor rank is NP-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3203928)
