|
109
|
Introduction to Probabilistic Automata
– Paz
|
|
58
|
A note on the joint spectral radius
– Rota, Strang
- 1960
|
|
56
|
Lagarias. Sets of matrices all infinite products of which converge
– Daubechies, C
- 1992
|
|
55
|
Stability of discrete linear inclusions
– Gurvits
- 1995
|
|
53
|
Bounded semigroups of matrices
– Berger, Wang
- 1992
|
|
48
|
The finiteness conjecture for the generalized spectral radius of a set of matrices
– Lagarias, Wang
- 1995
|
|
46
|
The lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate
– Tsitsiklis, Blondel
- 1997
|
|
43
|
On the complexity of space bounded interactive proofs
– CONDON, LADNER
- 1989
|
|
39
|
Checking robust nonsingularity is np-hard
– Poljak, Rohn
- 1993
|
|
34
|
Several NP-hard problems arising in robust stability analysis
– Nemirovskii
- 1993
|
|
32
|
When is a pair of matrices mortal
– Blondel, Tsitsiklis
- 1997
|
|
32
|
Computational Complexity of � calculation
– Braatz, Young, et al.
- 1994
|
|
29
|
Algebraic unsolvability of problem of absolute stability of desynchronized systems
– Kozyakin
- 1990
|
|
13
|
On the stability of asynchronous iterative processes
– Tsitsiklis
- 1987
|
|
9
|
Tsitsiklis
– Blondel, N
- 1999
|
|
7
|
Stability of linear inclusions - Part 2
– Gurvits
- 1996
|
|
7
|
On the complexity of purely complex computation and related problems in multidimensional systems
– Toker, Ozbay
- 1998
|
|
6
|
On the complexity of the robust stability problem for linear parameter varying systems
– Toker
- 1997
|
|
5
|
The Stability of the Products of a Finite Set of
– Tsitsiklis
- 1987
|
|
3
|
Tsitsiklis (2000). A survey of computational complexity results in systems and control
– Blondel, N
|
|
3
|
An algorithm for calculating the cardinal, finite or infinite, of the semigroups of matrices
– Jacob
- 1977
|
|
2
|
On the computability of infinite-horizon partially observable Markov decision processes, unpublished manuscript
– Madani
- 1998
|
|
