Pages that link to "Item:Q5419098"
From MaRDI portal
The following pages link to Subexponential lower bounds for randomized pivoting rules for the simplex algorithm (Q5419098):
Displaying 22 items.
- On the lexicographic centre of multiple objective optimization (Q274101) (← links)
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384506) (← links)
- A counterexample to the Hirsch conjecture (Q447933) (← links)
- Polynomial-time algorithms for energy games with special weight structures (Q487011) (← links)
- Directed random walks on polytopes with few facets (Q1690029) (← links)
- Improved bound on the worst case complexity of policy iteration (Q1785761) (← links)
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp (Q2233425) (← links)
- Geometric random edge (Q2364496) (← links)
- A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games (Q3009763) (← links)
- The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes (Q3465936) (← links)
- (Q4553289) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- (Q5028462) (← links)
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time (Q5092368) (← links)
- (Q5111758) (← links)
- Random Walks on Polytopes of Constant Corank (Q5116520) (← links)
- A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
- More bounds on the diameters of convex polytopes (Q5299904) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← 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)
- The Polyhedral Geometry of Pivot Rules and Monotone Paths (Q6075416) (← links)
