Pages that link to "Item:Q671935"
From MaRDI portal
The following pages link to The worst-case running time of the random simplex algorithm is exponential in the height (Q671935):
Displaying 6 items.
- Random edge can be exponential on abstract cubes (Q2496719) (← links)
- A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games (Q3009763) (← links)
- One line and n points (Q4446873) (← links)
- The Random‐Facet simplex algorithm on combinatorial cubes (Q4537627) (← links)
- Random Walks on Polytopes of Constant Corank (Q5116520) (← links)
- Reverse 1-centre problem on trees under convex piecewise-linear cost function (Q5882838) (← links)
