Exact interval solutions of the discrete Bellman equation, and the polynomial complexity of problems in interval idempotent linear algebra. (Q1432368): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Grigori L. Litvinov / rank
 
Normal rank
Property / author
 
Property / author: Andrei N. Sobolevskiĭ / rank
 
Normal rank

Revision as of 18:01, 11 February 2024

scientific article
Language Label Description Also known as
English
Exact interval solutions of the discrete Bellman equation, and the polynomial complexity of problems in interval idempotent linear algebra.
scientific article

    Statements

    Exact interval solutions of the discrete Bellman equation, and the polynomial complexity of problems in interval idempotent linear algebra. (English)
    0 references
    15 June 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    linear matrix interval equation
    0 references
    discrete stationary Bellman equation
    0 references
    partially ordered semirings
    0 references
    computational complexity
    0 references
    positive semirings
    0 references