46 search results - page 2 / 10 » The Descriptive Complexity of Parity Games |
LPAR
2004
Springer
13 years 10 months ago
2004
Springer
We propose a new parameter for the complexity of ļ¬nite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
AAAI
2012
11 years 7 months ago
2012
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speciļ...
FSTTCS
2005
Springer
13 years 10 months ago
2005
Springer
Hierarchical graph deļ¬nitions allow a modular description of graphs using modules for the speciļ¬cation of repeated substructures. Beside this modularity, hierarchical graph deļ...
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...
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...