Design of algorithms for spatial-time reduction complexity of dynamic programming

DOI10.1049/IP-D.1992.0024MaRDI QIDQ4009211zbMATH OpenOpenAlexFDO

Authors

Publication date 27 September 1992

Published in IEE Proceedings D Control Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/ip-d.1992.0024

zbMATH Keywords

adaptive controlcontinuous-timespatial-time complexity reduction

Mathematics Subject Classification ID

Dynamic programming (90C39) Adaptive control/observation systems (93C40) Model systems in control theory (93C99) Stochastic systems and control (93E99)

Recommendations

• scientific article; zbMATH DE number 4157350
• An approximation algorithm and dynamic programming for reduction in heterogeneous environments
• Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs
• scientific article; zbMATH DE number 1798166
• Approximation algorithms for \(D\)-optimal design
• An optimal sublinear time parallel algorithm for some dynamic programming problems
• Space complexity of optimization problems in planar graphs

Cited in

(2)

• scientific article; zbMATH DE number 4157350 (Why is no real title available?)
• scientific article; zbMATH DE number 3999294 (Why is no real title available?)

This page was built for publication: Design of algorithms for spatial-time reduction complexity of dynamic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4009211)