11 search results - page 1 / 3 » An Exponential Lower Bound for the Parity Game Strategy Impr... |
LICS
2009
IEEE
13 years 11 months ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
FM
2008
Springer
13 years 6 months ago
2008
Springer
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
FORMATS
2008
Springer
13 years 6 months ago
2008
Springer
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
COCO
2007
Springer
13 years 11 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...