When is a Pair of Matrices Mortal?
暂无分享,去创建一个
[1] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.
[2] M. Paterson. Unsolvability in 3 × 3 Matrices , 1970 .
[3] James B. Morris. Formal Languages and their Relation to Automata , 1970 .
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] Jean-Jacques Pansiot. A Note on Post's Correspondence Problem , 1981, Inf. Process. Lett..
[6] John N. Tsitsiklis,et al. The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..
[7] Melven Krom,et al. Recursive Solvability of Problems with Matrices , 1989, Math. Log. Q..
[8] Michael S. Branicky. On a Class of General Hybrid Dynamical Systems , 1996 .
[9] O. Toker. On the Algorithmic Unsolvability of Some Stability Problems for Discrete Event Systems , 1996 .
[10] J. Tsitsiklis,et al. Spectral quantities associated to pairs of matrices are hard, when not impossible, to compute and to approximate , 1996 .