CP decomposition and weighted clique problem (Q2307404): Difference between revisions

@@ Property / describes a project that uses @@
+rTensor
@@ Property / describes a project that uses: rTensor / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.spl.2020.108723
+Normal rank
@@ Property / OpenAlex ID @@
+W3008105551
@@ Property / OpenAlex ID: W3008105551 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young'' decomposition
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Orthogonal Tensor Decompositions
@@ Property / cites work: Orthogonal Tensor Decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Tensor Decompositions and Applications
@@ Property / cites work: Tensor Decompositions and Applications / rank @@
+Normal rank