Pages that link to "Item:Q3009763"

The following pages link to A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games (Q3009763):

Displaying 16 items.

• 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)
• An exponential lower bound for Cunningham's rule (Q507321) (← links)
• On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes (Q713305) (← links)
• Improved bound on the worst case complexity of policy iteration (Q1785761) (← links)
• Abstract tropical linear programming (Q2188843) (← links)
• A double-pivot simplex algorithm and its upper bounds of the iteration numbers (Q2214920) (← links)
• Geometric random edge (Q2364496) (← links)
• Symmetric Strategy Improvement (Q3449491) (← links)
• The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes (Q3465936) (← links)
• Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
• (Q5111758) (← links)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← 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)