One line and n points (Q4446873): Difference between revisions

@@ Property / cites work @@
+The worst-case running time of the random simplex algorithm is exponential in the height
+Normal rank
@@ Property / cites work @@
+Randomized simplex algorithms on Klee-Minty cubes
@@ Property / cites work: Randomized simplex algorithms on Klee-Minty cubes / rank @@
+Normal rank
@@ Property / cites work @@
+Linear programming, the simplex algorithm and simple polytopes
+Normal rank
@@ Property / cites work @@
+Q3914762
@@ Property / cites work: Q3914762 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4217266
@@ Property / cites work: Q4217266 / rank @@
+Normal rank
@@ Property / cites work @@
+Entering and leaving \(j\)-facets
@@ Property / cites work: Entering and leaving \(j\)-facets / rank @@
+Normal rank