most citedA Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it

11 citations · 11 across the 1 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

math.OC2019

An Exponential Lower Bound for Zadeh's pivot rule

Yann Disser, Oliver Friedmann, Alexander V. Hopp

The question whether the Simplex Algorithm admits an efficient pivot rule remains one of the most important open questions in discrete optimization. While many natural, determinist…