Pages that link to "Item:Q4312749"
From MaRDI portal
The following pages link to Lower bounds for a subexponential optimization algorithm (Q4312749):
Displaying 8 items.
- Unique sink orientations of grids (Q930596) (← links)
- Linear programming, the simplex algorithm and simple polytopes (Q1365056) (← links)
- A subexponential bound for linear programming (Q1923862) (← links)
- A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations (Q2363352) (← links)
- Random edge can be exponential on abstract cubes (Q2496719) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- (Q5111758) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)
