1 paper · 1 filter
Konrad Staniszewski
The exact complexity of solving parity games is a major open problem. Several authors have searched for efficient algorithms over specific classes of graphs. In particular, Obdržál…