A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Discrete Subexponential Algorithm for Parity Games
[chapter]
2003
Lecture Notes in Computer Science
We suggest a new randomized algorithm for solving parity games with worst case time complexity roughly min " O
doi:10.1007/3-540-36494-3_58
fatcat:szthswm2jnenhepgvxtkgnr4zi