This paper presents a new lower bound for the recursive algorithm for solving parity games which is induced by the constructive proof of memoryless determinacy by Zielonka. We outline a family of games of linear size on which the algorithm requires exponential time
The existence of polynomial time algorithms for the solution of parity games is a major open problem...
We suggest a new randomized algorithm for solving parity games with worst case time complexity roug...
Parity games are two-player games, played on directed graphs, whose nodes are labeled with prioritie...
This paper presents a new lower bound for the recursive algorithm for solving parity games which is ...
Dull, weak and nested solitaire games are important classes of parity games, capturing, among others...
Dull, weak and nested solitaire games are important classes of parity games, capturing, among others...
Zielonka's classic recursive algorithm for solving parity games is perhapsthe simplest among the man...
Dull, weak and nested solitaire games are important classes of parity games, capturing, among others...
We study parity games in which one of the two players controls only a small number k of nodes and th...
Calude, Jain, Khoussainov, Li, and Stephan (2017) proposed a quasi-polynomial-time algorithm solving...
Abstract. Parity games are 2-player games of perfect information and infinite duration that have imp...
The existence of polynomial time algorithms for the solution of parity games is a major open problem...
We suggest a new randomized algorithm for solving parity games with worst case time complexity roug...
Parity games are two-player games, played on directed graphs, whose nodes are labeled with prioritie...
This paper presents a new lower bound for the recursive algorithm for solving parity games which is ...
Dull, weak and nested solitaire games are important classes of parity games, capturing, among others...
Dull, weak and nested solitaire games are important classes of parity games, capturing, among others...
Zielonka's classic recursive algorithm for solving parity games is perhapsthe simplest among the man...
Dull, weak and nested solitaire games are important classes of parity games, capturing, among others...
We study parity games in which one of the two players controls only a small number k of nodes and th...
Calude, Jain, Khoussainov, Li, and Stephan (2017) proposed a quasi-polynomial-time algorithm solving...
Abstract. Parity games are 2-player games of perfect information and infinite duration that have imp...
The existence of polynomial time algorithms for the solution of parity games is a major open problem...
We suggest a new randomized algorithm for solving parity games with worst case time complexity roug...
Parity games are two-player games, played on directed graphs, whose nodes are labeled with prioritie...
DOI
Add to ORKG