Pages that link to "Item:Q1307309"
From MaRDI portal
The following pages link to Randomized simplex algorithms on Klee-Minty cubes (Q1307309):
Displayed 4 items.
- The worst-case running time of the random simplex algorithm is exponential in the height (Q671935) (← links)
- Random edge can be exponential on abstract cubes (Q2496719) (← links)
- One line and n points (Q4446873) (← links)
- The Random‐Facet simplex algorithm on combinatorial cubes (Q4537627) (← links)