Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard.
Vincent D. BlondelStéphane GaubertJohn N. TsitsiklisPublished in: IEEE Trans. Autom. Control. (2000)
Keyphrases
- np hard
- special case
- approximation algorithms
- optimal solution
- computational complexity
- closely related
- linear programming
- remains np hard
- worst case
- scheduling problem
- data model
- query language
- np complete
- singular value decomposition
- real numbers
- data sets
- decision problems
- neural network
- integer programming
- pairwise comparison
- circular arcs
- maximal tractable
- databases