The Rabin index of parity games: its complexity and approximation (Q897647)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Rabin index of parity games: its complexity and approximation |
scientific article; zbMATH DE number 6516964
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Rabin index of parity games: its complexity and approximation |
scientific article; zbMATH DE number 6516964 |
Statements
The Rabin index of parity games: its complexity and approximation (English)
0 references
7 December 2015
0 references
logic in computer science
0 references
paths and cycles
0 references
computational difficulty of problems
0 references
descriptive complexity
0 references
specification and verification
0 references
parity games
0 references
game graphs
0 references
Rabin index
0 references
0 references
0.8894168
0 references
0.8871498
0 references
0.8831161
0 references
0.88246423
0 references
0.88120013
0 references
