## Idempotent and tropical mathematics. Complexity of algorithms and interval analysis

- Grigori L. Litvinov
- Computers & Mathematics with Applications
- 2013

@inproceedings{Litvinov2001ExactIS, title={Exact Interval Solutions of the Discrete Bellman Equation and Polynomial Complexity of Problems in Interval Idempotent Linear Algebra}, author={Grigori L. Litvinov and A N Sobolevskii}, year={2001} }

- Published 2001

In this paper, we construct a solution to a linear matrix interval equation of the form X = AX + B (the discrete stationary Bellman equation) over partially ordered semirings, including the semiring R + of nonnegative real numbers and all idempotent semirings. We also discuss the computational complexity of problems in interval idempotent linear algebra (for more detail on idempotent mathematics , see, e.g., [1, 2]). In traditional interval analysis, problems of this kind are generally N P-hard… CONTINUE READING