Pages that link to "Item:Q2730242"
From MaRDI portal
The following pages link to Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard (Q2730242):
Displayed 10 items.
- Tail asymptotics for discrete event systems (Q964839) (← links)
- Continuity of the generalized spectral radius in max algebra (Q1014497) (← links)
- Computing the average parallelism in trace monoids. (Q1417573) (← links)
- A central limit theorem for stochastic recursive sequences of topical operators (Q2467606) (← links)
- On the max version of the generalized spectral radius theorem (Q2483267) (← links)
- Extremal \(L_p\)-norms of linear operators and self-similar functions (Q2483270) (← links)
- On the average Cartier-Foata height of traces (Q3438975) (← links)
- APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS (Q3538847) (← links)
- Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids (Q5428221) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)