Pages that link to "Item:Q1923862"
From MaRDI portal
The following pages link to A subexponential bound for linear programming (Q1923862):
Displaying 17 items.
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games (Q5089201) (← links)
- (Q5091276) (← links)
- A combinatorial bound for linear programming and related problems (Q5096811) (← links)
- (Q5111758) (← links)
- A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS (Q5305065) (← links)
- Optimal Triangulation with Steiner Points (Q5387801) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
- Markov incremental constructions (Q5896960) (← links)
- Analysis of incomplete data and an intrinsic-dimension Helly theorem (Q5901492) (← links)
- Two-variable linear programming in parallel (Q5959558) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)
- An exponential lower bound for Zadeh's pivot rule (Q6038661) (← links)
- Sectorial coverage control with load balancing in non-convex hollow environments (Q6049099) (← links)
- Simple linear time algorithms for piercing pairwise intersecting disks (Q6110069) (← links)
- Stabbing pairwise intersecting disks by four points (Q6142366) (← links)
