The boundedness of all products of a pair of matrices is undecidable

[1]  Thomas M. Cover,et al.  Open Problems in Communication and Computation , 2011, Springer New York.

[2]  John N. Tsitsiklis,et al.  A survey of computational complexity results in systems and control , 2000, Autom..

[3]  Anne Condon,et al.  On the Undecidability of Probabilistic Planning and Infinite-Horizon Partially Observable Markov Decision Problems , 1999, AAAI/IAAI.

[4]  John N. Tsitsiklis,et al.  Complexity of stability and controllability of elementary hybrid systems , 1999, Autom..

[5]  O. Toker,et al.  On the complexity of purely complex μ computation and related problems in multidimensional systems , 1998, IEEE Trans. Autom. Control..

[6]  John N. Tsitsiklis,et al.  When is a Pair of Matrices Mortal? , 1997, Inf. Process. Lett..

[7]  John N. Tsitsiklis,et al.  The Lyapunov exponent and joint spectral radius of pairs of matrices are hard—when not impossible—to compute and to approximate , 1997, Math. Control. Signals Syst..

[8]  Onur Toker,et al.  On the complexity of the robust stability problem for linear parameter varying systems , 1996, Autom..

[9]  L. Gurvits.  Stability of discrete linear inclusion , 1995 .

[10]  M. Morari,et al.  Computational complexity of /spl mu/ calculation , 1994 .

[11]  Richard D. Braatz,et al.  Computational Complexity of , 2007 .

[12]  A. Nemirovskii.  Several NP-hard problems arising in robust stability analysis , 1993 .

[13]  Svatopluk Poljak,et al.  Checking robust nonsingularity is NP-hard , 1993, Math. Control. Signals Syst..

[14]  Yang Wang,et al.  Bounded semigroups of matrices , 1992 .

[15]  I. Daubechies,et al.  Sets of Matrices All Infinite Products of Which Converge , 1992 .

[16]  Richard J. Lipton,et al.  On the complexity of space bounded interactive proofs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[17]  John N. Tsitsiklis,et al.  On the stability of asynchronous iterative processes , 1986, 1986 25th IEEE Conference on Decision and Control.

[18]  Gérard Jacob,et al.  Un Algorithme Calculant le Cardinal, Fini ou Infini, des Demi-Groupes de Matrices , 1977, Theor. Comput. Sci..

[19]  J. Lagarias,et al.  The finiteness conjecture for the generalized spectral radius of a set of matrices , 1995 .

[20]  Arkadi Nemirovski,et al.  Several NP-hard problems arising in robust stability analysis , 1993, Math. Control. Signals Syst..

[21]  R. Lipton,et al.  Upper Bounds on the Complexity of Space Bounded Interactive Proofs , 1989 .

[22]  J. Tsitsiklis.  The Stability of the Products of a Finite Set of Matrices , 1987 .

[23]  Azaria Paz,et al.  Introduction to Probabilistic Automata , 1971 .

[24]  G. Rota,et al.  A note on the joint spectral radius , 1960 .