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
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:11, 31 January 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
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
