5 citations · 13 across the 15 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.FL2023
Simple and tight complexity lower bounds for solving Rabin games
Antonio Casares, Marcin Pilipczuk, Michał Pilipczuk +2
We give a simple proof that assuming the Exponential Time Hypothesis (ETH), determining the winner of a Rabin game cannot be done in time , where $k…
cs.GT2023★ 3 cited
Solving Two-Player Games under Progress Assumptions
Anne-Kathrin Schmuck, K. S. Thejaswini, Irmak Sağlam +1
This paper considers the problem of solving infinite two-player games over finite graphs under various classes of progress assumptions motivated by applications in cyber-physical s…