RAIRO-Theor. Inf. Appl.
Volume 45, Number 4, October-December 2011
|Page(s)||449 - 457|
|Published online||14 November 2011|
Recursive algorithm for parity games requires exponential time
Institut für Informatik, LMU München 80538 Munich, Germany
Received: 23 January 2011
Accepted: 22 September 2011
This paper presents a new lower bound for the recursive algorithm for solving parity games which is induced by the constructive proof of memoryless determinacy by Zielonka. We outline a family of games of linear size on which the algorithm requires exponential time.
Mathematics Subject Classification: 05C57
Key words: Parity games / recursive algorithm / lower bound / μcalculus / model checking
© EDP Sciences 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.