THE STEVENS-STIRLING-ALGORITHM FOR SOLVING PARITY GAMES LOCALLY REQUIRES EXPONENTIAL TIME (Q3569271)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | THE STEVENS-STIRLING-ALGORITHM FOR SOLVING PARITY GAMES LOCALLY REQUIRES EXPONENTIAL TIME |
scientific article |
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
