Hi all,
let me invite you to tomorrow's seminar given by Karel Král. He will present a paper Cristian S. Claude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Frank Stephan -- Deciding Parity Games in Quasipolynomial Time
An interesting feature of parity games is that we don't know, whether they are NP complete, or polynomial -- though they belong to NP and co-NP, and (as shown in this paper) they also have a quasipolynomial time solution.
See you tomorrow,
R -- Robert Šámal IÚUK MFF UK -- CSI of Charles University in Prague