On the nonnegative rank of distance matrices (Q436566): Difference between revisions

@@ 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.ipl.2012.02.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2023307697
@@ Property / OpenAlex ID: W2023307697 / rank @@
+Normal rank
@@ Property / cites work @@
+Real rank versus nonnegative rank
@@ Property / cites work: Real rank versus nonnegative rank / rank @@
+Normal rank
@@ Property / cites work @@
+Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
+Normal rank
@@ Property / cites work @@
+Linear vs. semidefinite extended formulations
@@ Property / cites work: Linear vs. semidefinite extended formulations / rank @@
+Normal rank
@@ Property / cites work @@
+On convex complexity measures
@@ Property / cites work: On convex complexity measures / rank @@
+Normal rank
@@ Property / cites work @@
+On the nonnegative rank of Euclidean distance matrices
+Normal rank
@@ Property / cites work @@
+Applications of matrix methods to the theory of lower bounds in computational complexity
+Normal rank
@@ Property / cites work @@
+Q4036701
@@ Property / cites work: Q4036701 / rank @@
+Normal rank
@@ Property / cites work @@
+Some \(0/1\) polytopes need exponential size extended formulations
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank
@@ Property / cites work @@
+Expressing combinatorial optimization problems by linear programs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:436566