A Deterministic Subexponential Algorithm for Solving Parity Games

The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that run in subexponential time. These algorithms are all ultimately based on the randomized subexponential simplex algorithms of Kalai and of Matousek, Sharir and Welzl. Randomness seems to play an essential role in these algorithms. We use a completely different, and elementary, approach to obtain a deterministic subexponential algorithm for the solution of parity games. Our deterministic algorithm is almost as fast as the randomized algorithms mentioned above.

• Type: Journal
• Year: 2008
• Where: SIAMCOMP
• Authors: Marcin Jurdzinski, Mike Paterson, Uri Zwick
• Keywords: Algorithms, Fastest Known Algorithms, Polynomial Time Algorithms, SIAMCOMP 2008