1 Hit in 4.5 sec

Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games [article]

Oliver Friedmann and Thomas Dueholm Hansen and Uri Zwick
2014 arXiv   pre-print
We then obtained a lower bound on the expected number of pivoting steps performed by Random-Facet^* and claimed that the same lower bound holds also for Random-Facet.  ...  number of pivoting steps performed by Random-Facet^*, a variant of Random-Facet that bases its random decisions on one random permutation.  ...  The Random-Facet * algorithm is identical to the Random-Facet algorithm, except that it takes as an additional argument a permutation σ : E → {1, . . . , |E|} of the edges and always removes the first  ... 
arXiv:1410.7871v1 fatcat:dlj3nlyqwjfmlodj7ffpgxnpaq