33 search results - page 1 / 7 » A Deterministic Subexponential Algorithm for Solving Parity ... |
SIAMCOMP
2008
14 years 6 months ago
2008
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...
CORR
2008
Springer
14 years 6 months ago
2008
Springer
Abstract. This article extends the idea of solving parity games by strategy iteration to non-deterministic strategies: In a non-deterministic strategy a player restricts himself to...
ATVA
2009
Springer
15 years 25 days ago
2009
Springer
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
CAV
2009
Springer
15 years 1 months ago
2009
Springer
In this paper we consider two-player zero-sum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consi...
ENTCS
2008
14 years 6 months ago
2008
We describe a parallel algorithm for solving parity games, with applications in, e.g., modal