CP decomposition and weighted clique problem (Q2307404): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young'' decomposition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Orthogonal Tensor Decompositions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tensor Decompositions and Applications / rank | |||
Normal rank | |||
Latest revision as of 05:05, 22 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | CP decomposition and weighted clique problem |
scientific article |
Statements
CP decomposition and weighted clique problem (English)
0 references
27 March 2020
0 references
CP decomposition
0 references
dimension reduction
0 references
weighted clique problem
0 references
NP-hard
0 references
subdecomposition
0 references
tensors
0 references
