A subexponential lower bound for the Random Facet algorithm for Parity Games

Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick. A subexponential lower bound for the Random Facet algorithm for Parity Games. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011. pages 202-216, SIAM, 2011. [doi]

Abstract

Abstract is missing.