Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard (Q2730242): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q197785 |
Changed an Item |
||
| Property / author | |||
| Property / author: John N. Tsitsiklis / rank | |||
Normal rank | |||
Revision as of 15:53, 10 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
