Pages that link to "Item:Q5454270"
From MaRDI portal
The following pages link to Two New Bounds for the Random‐Edge Simplex‐Algorithm (Q5454270):
Displaying 6 items.
- The worst-case running time of the random simplex algorithm is exponential in the height (Q671935) (← links)
- Monotone paths in geometric triangulations (Q726107) (← links)
- Geometric random edge (Q2364496) (← links)
- Random-Edge Is Slower Than Random-Facet on Abstract Cubes (Q4598190) (← links)
- Improved upper bounds for Random-Edge and Random-Jump on abstract cubes (Q5384026) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)