## A deterministic subexponential algorithm for solving parity games (2006)

### Cached

### Download Links

- [www.dcs.warwick.ac.uk]
- [www.dcs.warwick.ac.uk]
- [www.dcs.warwick.ac.uk]
- DBLP

### Other Repositories/Bibliography

Venue: | SODA |

Citations: | 48 - 1 self |

### BibTeX

@INPROCEEDINGS{Jurdziński06adeterministic,

author = {Marcin Jurdziński and Mike Paterson and Uri Zwick},

title = {A deterministic subexponential algorithm for solving parity games},

booktitle = { SODA},

year = {2006},

pages = {117--123},

publisher = {ACM-SIAM}

}

### Years of Citing Articles

### OpenURL

### Abstract

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. The new algorithm, like the existing randomized subexponential algorithms, uses only polynomial space, and it is almost as fast as the randomized subexponential algorithms mentioned above.