An exponential lower bound for Zadeh's pivot rule (Q6038661): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4188659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential lower bound for Cunningham's rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving convex programs by random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Properties of the Network Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Friedmann's subexponential lower bound for Zadeh's pivot rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplex Algorithm Is NP-Mighty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple polynomial-time rescaling algorithm for solving linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Lower Bounds for Policy Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential lower bounds for randomized pivoting rules for the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case behavior of the steepest edge simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming, the simplex algorithm and simple polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized polynomial-time simplex algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, logics, and infinite games. A guide to current research / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential bound for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random edge can be exponential on abstract cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5305630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to the Hirsch conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical problems for the next century / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5291082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Kalai--Kleitman Bound for the Diameter of a Polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754084 / rank
 
Normal rank

Revision as of 01:55, 1 August 2024

scientific article; zbMATH DE number 7681268
Language Label Description Also known as
English
An exponential lower bound for Zadeh's pivot rule
scientific article; zbMATH DE number 7681268

    Statements

    An exponential lower bound for Zadeh's pivot rule (English)
    0 references
    0 references
    0 references
    0 references
    2 May 2023
    0 references
    simplex method
    0 references
    Zadeh's rule
    0 references
    lower bound
    0 references
    parity games
    0 references
    Markov decision processes
    0 references
    strategy improvement
    0 references
    policy iteration
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references