The complexity of dynamic programming
type: Item
instance of: scholarly article
title: The complexity of dynamic programming
zbMATH Open document ID: 0685.90098
DOI: 10.1016/0885-064X(89)90021-6
author: Chee-Seng Chow
author: John N. Tsitsiklis
published in: Journal of Complexity
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 93E20
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 4123552
zbMATH Keywords: tight lower bounds
zbMATH Keywords: computational complexity
zbMATH Keywords: discrete-time, stationary, infinite horizon, discounted
zbMATH Keywords: stochastic control
zbMATH Keywords: discrete-time, stationary, infinite horizon, discounted stochastic control
MaRDI profile type: Publication
cites work: Q3795523
cites work: Convergence of discretization procedures in dynamic programming
cites work: Stochastic optimal control. The discrete time case
cites work: Q3340621
cites work: Q3967358
cites work: The Complexity of Markov Decision Processes
cites work: Q3993279
cites work: Q3747683
cites work: Approximations of Dynamic Programs, I
full work available at URL: 0885-064x(89)90021-6
OpenAlex ID: W2006583280
Recommended article: Q4231140
Recommended article: Q4948612
Recommended article: Q3081835
Recommended article: Q4003318
Recommended article: Q3084279
Recommended article: Computational Aspects of Dynamic Programming
Recommended article: The theory of dynamic programming
Recommended article: On a problem of the theory of dynamic programming
Recommended article: Some Problems in the Theory of Dynamic Programming
description: scientific article; zbMATH DE number 4123552