Complexity of finite-horizon Markov decision process problems (Q3457753): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1058525 |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Eric W. Allender / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1145/347476.347480 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1981691276 / rank | |||
Normal rank |
Latest revision as of 03:22, 20 March 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