A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games (Q3009763): 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: Q3376697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced Gray codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The worst-case running time of the random simplex algorithm is exponential in the height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state Markovian decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affirmative action algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Lower Bounds for Policy Iteration / 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: Randomized simplex algorithms on Klee-Minty cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: One line and n points / 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: Automata, logics, and infinite games. A guide to current research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplex algorithm with the pivot rule of maximizing criterion improvement / 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: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential bound for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754084 / rank
 
Normal rank

Latest revision as of 04:43, 4 July 2024

scientific article
Language Label Description Also known as
English
A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games
scientific article

    Statements

    Identifiers

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