The complexity of solving reachability games using value and strategy iteration (Q2254503)
From MaRDI portal
(Redirected from Item:Q3007618)
 | 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 complexity of solving reachability games using value and strategy iteration |
scientific article; zbMATH DE number 5908672
- The Complexity of Solving Reachability Games Using Value and Strategy Iteration
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of solving reachability games using value and strategy iteration |
scientific article; zbMATH DE number 5908672 |
|
Statements
The complexity of solving reachability games using value and strategy iteration (English)
0 references
The Complexity of Solving Reachability Games Using Value and Strategy Iteration (English)
0 references
5 February 2015
0 references
17 June 2011
0 references
concurrent reachability games
0 references
value iteration
0 references
strategy iteration
0 references
analysis of algorithms
0 references
0 references
0 references
0 references
0.8989402
0 references
0.89557254
0 references
0.89005256
0 references
0.88608116
0 references
0.8805153
0 references
0 references
