CP decomposition and weighted clique problem
From MaRDI portal
Publication:2307404
DOI10.1016/j.spl.2020.108723zbMath1435.62350OpenAlexW3008105551MaRDI QIDQ2307404
Publication date: 27 March 2020
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spl.2020.108723
Factor analysis and principal components; correspondence analysis (62H25) Analysis of algorithms and problem complexity (68Q25) Neural nets and related approaches to inference from stochastic processes (62M45) Tensor products of linear operators (47A80)
Uses Software
Cites Work
- Tensor Decompositions and Applications
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Orthogonal Tensor Decompositions