On Kruskal's theorem that every \(3{\times}3{\times}3\) array has rank at most 5 (Q2637157): Difference between revisions

@@ Property / cites work @@
+Canonical forms of 2 × 2 × 2 and 2 × 2 × 2 × 2 arrays over 𝔽<sub>2</sub>and 𝔽<sub>3</sub>
+Normal rank
@@ Property / cites work @@
+Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
+Normal rank
@@ Property / cites work @@
+Optimal Evaluation of Pairs of Bilinear Forms
@@ Property / cites work: Optimal Evaluation of Pairs of Bilinear Forms / rank @@
+Normal rank
@@ Property / cites work @@
+Tensor Decompositions and Applications
@@ Property / cites work: Tensor Decompositions and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Kruskal's polynomial for \(2 \times{}2 \times{}2\) arrays and a generalization to \(2 \times{}n \times{}n\) arrays
+Normal rank
@@ Property / cites work @@
+Maximal bilinear complexity and codes
@@ Property / cites work: Maximal bilinear complexity and codes / rank @@
+Normal rank