The Stevens-Stirling-algorithm for solving parity games locally requires exponential time (Q3569271)
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 Stevens-Stirling-algorithm for solving parity games locally requires exponential time |
scientific article; zbMATH DE number 5723426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Stevens-Stirling-algorithm for solving parity games locally requires exponential time |
scientific article; zbMATH DE number 5723426 |
Statements
THE STEVENS-STIRLING-ALGORITHM FOR SOLVING PARITY GAMES LOCALLY REQUIRES EXPONENTIAL TIME (English)
0 references
18 June 2010
0 references
parity game
0 references
lower bound
0 references
\(\mu\)-calculus model checking
0 references
Stevens-Stirling algorithm
0 references
exponential bound
0 references
0.8731012344360352
0 references
0.7962120175361633
0 references
0.7950746417045593
0 references
0.7920852899551392
0 references
