A Discrete Subexponential Algorithm for Parity Games [chapter]

Henrik Björklund, Sven Sandberg, Sergei Vorobyov
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