The Complexity of Markov Decision Processes (Q3780028): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q29038896, #quickstatements; #temporary_batch_1711196317277 |
Created claim: DBLP publication ID (P1635): journals/mor/PapadimitriouT87, #quickstatements; #temporary_batch_1731483406851 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/mor/PapadimitriouT87 / rank | |||
Normal rank | |||
Revision as of 09:16, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Markov Decision Processes |
scientific article |
Statements
The Complexity of Markov Decision Processes (English)
0 references
1987
0 references
computational complexity
0 references
parallel computation
0 references
optimal policy computation
0 references
Markov decision processes
0 references
finite horizon
0 references
infinite horizon
0 references
highly parallel algorithms
0 references
partially observed states
0 references
PSPACE-complete
0 references
NP-complete
0 references
