DMCA
Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games (2014)
| Citations: | 2 - 2 self |
BibTeX
@MISC{Friedmann14erratafor:,
author = {Oliver Friedmann and Thomas Dueholm and Hansen Uri Zwick},
title = {Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games},
year = {2014}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In [Friedmann, Hansen, and Zwick (2011)] and we claimed that the expected number of pivoting steps performed by the Random-Facet algorithm of Kalai and of Matoušek, Sharir, and Welzl is equal to the expected number of pivoting steps performed by Random-Facet∗, a variant of Random-Facet that bases its random decisions on one random permutation. 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. Unfortunately, the claim that the expected number of steps performed by Random-Facet and Random-Facet ∗ are the same is false. We provide here simple examples that show that the expected number of steps performed by the two algorithms is not the same. 1
