Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard (Q2730242): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:52, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard |
scientific article |
Statements
Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard (English)
0 references
5 August 2001
0 references
computational complexity
0 references
discrete event systems
0 references
max-plus algebra
0 references
NP-hard
0 references
spectral radius
0 references
