Exact interval solutions of the discrete Bellman equation, and the polynomial complexity of problems in interval idempotent linear algebra.
From MaRDI portal
Publication:1432368
zbMath1045.65037arXivmath/0101041MaRDI QIDQ1432368
Andrei N. Sobolevskiĭ, Grigori L. Litvinov
Publication date: 15 June 2004
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0101041
computational complexitypositive semiringsdiscrete stationary Bellman equationlinear matrix interval equationpartially ordered semirings
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Idempotent and tropical mathematics; complexity of algorithms and interval analysis ⋮ Robustness of fuzzy interval circulant-Hankel matrices
This page was built for publication: Exact interval solutions of the discrete Bellman equation, and the polynomial complexity of problems in interval idempotent linear algebra.