The complexity of graph-based reductions for reachability in Markov decision processes (Q1652999)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6904546
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of graph-based reductions for reachability in Markov decision processes |
scientific article; zbMATH DE number 6904546 |
Statements
The complexity of graph-based reductions for reachability in Markov decision processes (English)
0 references
17 July 2018
0 references
0.6900807619094849
0 references
0.6886264681816101
0 references
0.6886000633239746
0 references
0.6866006851196289
0 references
