One line and n points (Q4446873): 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.1002/rsa.10099
@@ Property / full work available at URL: https://doi.org/10.1002/rsa.10099 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2079716694
@@ Property / OpenAlex ID: W2079716694 / rank @@
+Normal rank
@@ 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