Simple and tight complexity lower bounds for solving Rabin games
We give a simple proof that assuming the Exponential Time Hypothesis (ETH), determining
the winner of a Rabin game cannot be done in time 2o (k log k)· nO (1), where k is the …
the winner of a Rabin game cannot be done in time 2o (k log k)· nO (1), where k is the …
Deciding regular games: a playground for exponential time algorithms
Z Liang, B Khoussainov, M Xiao - arXiv preprint arXiv:2405.07188, 2024 - arxiv.org
Regular games form a well-established class of games for analysis and synthesis of reactive
systems. They include coloured Muller games, McNaughton games, Muller games, Rabin …
systems. They include coloured Muller games, McNaughton games, Muller games, Rabin …