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 cs.GTShow all

1 paper · 1 filter

cs.GT2009★ 11 cited

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

Oliver Friedmann

This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to Voege and Jurdziski. First, we informally show which structure…