The Rabin index of parity games: Its complexity and approximation

We study the descriptive complexity of parity games by taking into account the coloring of their game graphs whilst ignoring their ownership structure. Colorings of game graphs are identified if they determine the same winning regions and strategies, for all ownership structures of nodes. The Rabin...

Celý popis

Podrobná bibliografie

Vydáno v:	Information and computation Ročník 245; s. 36 - 53
Hlavní autoři:	Huth, Michael, Kuo, Jim Huan-Pu, Piterman, Nir
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Inc 01.12.2015
Témata:	Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) Descriptive complexity and finite models Graph theory: paths and cycles Logic in computer science Specification and verification (program logics, model checking, etc.) Specification and verification (program logics, model checking, etc.) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) Logic in computer science Descriptive complexity and finite models Graph theory: paths and cycles
ISSN:	0890-5401, 1090-2651
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!