The complexity of dynamic programming (Q1262227): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3795523 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergence of discretization procedures in dynamic programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stochastic optimal control. The discrete time case / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3340621 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3967358 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Complexity of Markov Decision Processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3993279 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3747683 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximations of Dynamic Programs, I / rank | |||
Normal rank |
Latest revision as of 11:31, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The complexity of dynamic programming |
scientific article |
Statements
The complexity of dynamic programming (English)
0 references
1989
0 references
tight lower bounds
0 references
computational complexity
0 references
discrete-time, stationary, infinite horizon, discounted
0 references
stochastic control
0 references
discrete-time, stationary, infinite horizon, discounted stochastic control
0 references