A survey of computational complexity results in systems and control
Top Cited Papers
- 1 September 2000
- journal article
- Published by Elsevier in Automatica
- Vol. 36 (9), 1249-1274
- https://doi.org/10.1016/s0005-1098(00)00050-9
Abstract
No abstract availableKeywords
This publication has 107 references indexed in Scilit:
- What's Decidable about Hybrid Automata?Journal of Computer and System Sciences, 1998
- Lyapunov exponents of pairs of matrices, a correctionMathematics of Control, Signals, and Systems, 1997
- The Lyapunov exponent and joint spectral radius of pairs of matrices are hard?when not impossible?to compute and to approximateMathematics of Control, Signals, and Systems, 1997
- Complexity issues in robust stability of linear delay-differential systemsMathematics of Control, Signals, and Systems, 1996
- The complexity of mean payoff games on graphsTheoretical Computer Science, 1996
- The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrixMathematics of Control, Signals, and Systems, 1994
- Computational complexity of μ calculationIEEE Transactions on Automatic Control, 1994
- Several NP-hard problems arising in robust stability analysisMathematics of Control, Signals, and Systems, 1993
- Checking robust nonsingularity is NP-hardMathematics of Control, Signals, and Systems, 1993
- Solving H-horizon, stationary Markov decision problems in time proportional to log(H)Operations Research Letters, 1990