Complexity of finite-horizon Markov decision process problems (Q3457753): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60016244, #quickstatements; #temporary_batch_1705829395789 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:28, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of finite-horizon Markov decision process problems |
scientific article |
Statements
Complexity of finite-horizon Markov decision process problems (English)
0 references
17 December 2015
0 references
computational complexity
0 references
Markov decision processes
0 references
NP, \(\mathrm{NP}^{\mathrm{PP}}\)
0 references
partially observable Markov decision processes
0 references
PL
0 references
PSPACE
0 references
succinct representations
0 references
