Survey of computational complexity results in systems and control

Automatica

Volumn 36, Issue 9, 2000, Pages 1249-1274

  Blondel, Vincent D ^a,f,g   Tsitsiklis, John N ^b,c,d,e  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Stanford University   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e INSTITUTE OF COMPUTER SCIENCE   (Greece)

^f INRIA   (France)

^g UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTROL THEORY; DISCRETE TIME CONTROL SYSTEMS; LINEAR CONTROL SYSTEMS; MATHEMATICAL MODELS; NONLINEAR CONTROL SYSTEMS; OPTIMAL CONTROL SYSTEMS; ROBUSTNESS (CONTROL SYSTEMS); STOCHASTIC CONTROL SYSTEMS; SYSTEM STABILITY; SYSTEM THEORY; TIME VARYING CONTROL SYSTEMS;

POLYNOMIAL TIME ALGORITHMS; UNDECIDABILITY;

COMPUTATIONAL COMPLEXITY;

EID: 0034264701     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0005-1098(00)00050-9     Document Type: Article

References (180)

1. Aho, A. V., Hopcroft, J. E., & Ullman, J. D. (1974). The design and analysis of computer algorithms. Reading, MA: Addison-Wesley.
2. Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T. A., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., & Yovine, S. (1995). The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138, 3-34.
3. Anderson, B. D. O., Bose, N. K., & Jury, E. I. (1975). Output feedback stabilization and related problem - solutions via decision methods. IEEE Transactions on Automatic Control, 20, 53-66.
4. Asarin, E., Maler, O., & Pnueli, A. (1995). Reachability analysis of dynamical systems having piecewise-constant derivatives. Theoretical Computer Science, 138, 35-66.
5. Baccelli, F., Cohen, G., Olsder, G.-J., & Quadrat, J.-P. (1992). Synchronization and linearity. New York: Wiley.
6. Barabanov, N. E. (1988). Lyapunov indicators of discrete inclusions, parts I, II and III, Avtomatika i Telemekhanika, 2, 40-46, 3, 24-29 and 5, 17-24. Translation in Automatic remote control (1988) part I, 49(3), 152-157, part II, 49(5), 558-565.
7. Barabanov, N. E. (1988). Lyapunov indicators of discrete inclusions, parts I, II and III, Avtomatika i Telemekhanika, 2, 40-46, 3, 24-29 and 5, 17-24. Translation in Automatic remote control (1988) part I, 49(3), 152-157, part II, 49(5), 558-565.
8. Barabanov, N. E. (1988). Lyapunov indicators of discrete inclusions, parts I, II and III, Avtomatika i Telemekhanika, 2, 40-46, 3, 24-29 and 5, 17-24. Translation in Automatic remote control (1988) part I, 49(3), 152-157, part II, 49(5), 558-565.
9. Barabanov, N. E. (1988). Lyapunov indicators of discrete inclusions, parts I, II and III, Avtomatika i Telemekhanika, 2, 40-46, 3, 24-29 and 5, 17-24. Translation in Automatic remote control (1988) part I, 49(3), 152-157, part II, 49(5), 558-565.
10. Barabanov, N. E. (1988). Lyapunov indicators of discrete inclusions, parts I, II and III, Avtomatika i Telemekhanika, 2, 40-46, 3, 24-29 and 5, 17-24. Translation in Automatic remote control (1988) part I, 49(3), 152-157, part II, 49(5), 558-565.
11. Barmish, B. R., Floudas, C. A., Hollot, C. V., & Tempo, R. (1994). A global linear programming solution to some open robustness problems. Proceedings of the American control conference, Seattle, USA (pp 3871-3877).
12. Bartlett, A. C., Hollot, C. V., & Huang, L. (1988). Root locations of an entire polytope of polynomials: It suffices to check the edges. Mathematics of Control, Signals, and Systems, 1, 61-71.
13. Basu, S., Pollack, R., & Roy, M.-F. (1996). On the combinatorial and algebraic complexity of quantifier elimination. Journal of the ACM, 43, 1002-1046.
14. Berger, M., & Wang, Y. (1992). Bounded semigroups of matrices. Linear Algebra Applications, 166, 21-27.
15. Bertsekas, D. P. (1995). Dynamic programming and optimal control. Belmont, MA: Athena Scientific.
16. Bertsimas, D., & Tsitsiklis, J. N. (1997). Introduction to linear optimization. Belmont, MA: Athena Scientific.
17. Bialas, S. (1985). A necessary and sufficient condition for the stability of convex combinations of stable polynomials or matrices. Bulletin of the Polish Academy of Sciences, Technical Sciences, 33, 473-480.
18. Blondel, V. D., Bournez, O., Koiran, P., Papadimitriou, C., & Tsitsiklis, J. N. (1999a). Deciding stability and mortality of piecewise affine dynamical systems. Preprint.
19. Blondel, V. D., Bournez, O., Koiran, P., & Tsitsiklis, J. N. (1999b). The stability of saturated linear dynamical systems is undecidable. Preprint.
20. Blondel, V. D., Gaubert, S., & Tsitsiklis, J. N. (1998). Approximating Lyapunov exponents of matrices in the max-algebra is NP-hard. Preprint.
21. Blondel, V. D., Gevers, M., & Lindquist, A. (1995). Survey on the state of systems and control. European Journal of Control, 1, 5-23.
22. Blondel, V. D., & Portier, N. (1999a). The presence of a zero in an integer linear recurrent sequence is NP-hard to decide. Preprint.
23. Blondel, V. D., & Tsitsiklis, J. N. (1997a). NP-hardness of some linear control design problems. SIAM Journal of Control and Optimization, 35, 2118-2127.
24. Blondel, V. D., & Tsitsiklis, J. N. (1997b). When is a pair of matrices mortal?. Information Processing Letters, 63, 283-286.
25. Blondel, V. D., & Tsitsiklis, J. N. (1998). Overview of complexity and decidability results for three classes of elementary nonlinear systems. In Y. Yamamoto, & S. Hara, Learning, control and hybrid systems (pp. 46-58) Heidelberg: Springer.
26. Blondel, V. D., & Tsitsiklis, J. N. (1999a). Complexity of stability and controllability of elementary hybrid systems. Automatica, 35, 479-489.
27. Blondel, V. D., & Tsitsiklis, J. N. (1999b). Boundedness of finitely generated matrix semigroups is undecidable. Preprint.
28. Blondel, V. D., Sontag, E. D., Vidyasagar, M., & Willems, J. C. (1999c). Open problems in mathematical systems and control theory. London: Springer, http://www.inma.ucl.ac.be/ ∼ blondel/openprobs.html.
29. Blum, L., Cucker, F., Shub, M., & Smale, S. (1998). Complexity and real computation. New York: Springer.
30. Bournez, O., & Cosnard, M. (1996). On the computational power of dynamical systems and hybrid systems. Theoretical Computer Science, 168, 417-459.
31. Bournez, O., & Branicky, M. (1998). On matrix mortality in low dimensions. Technical Report 98-01, Verimag, France.
32. Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994). Linear matrix inequalities in system and control theory. SIAM Studies in Applied Mathematics, vol. 15. Philadelphia, PA: SIAM.
33. Braatz, R., Young, P., Doyle, J., & Morari, M. (1994). Computational complexity of μ calculation. IEEE Transactions on Automatic Control, 39, 1000-1002.
34. Branicky, M.S. (1995a). Studies in hybrid systems: Modeling, analysis, and control. Ph.D. thesis, Center for Intelligent Control Systems, Cambridge, MA: MIT Press.
35. Branicky, M. S. (1995b). Universal computation and other capabilities of hybrid and continuous dynamical systems. Theoretical Computer Science, 138, 67-100.
36. Brayton, R., & Tong, C. (1980). Constructive stability and asymptotic stability of dynamical systems. IEEE Transactions on Circuits and Systems, 27, 1121-1130.
37. Bylander, T. (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69, 165-204.
38. Chow, C. -S., & Tsitsiklis, J. N. (1989). The complexity of dynamic programming. Journal of Complexity, 5, 466-488.
39. Chow, C. -S., & Tsitsiklis, J. N. (1991). An optimal one-way multigrid algorithm for discrete-time stochastic control. IEEE Transactions on Automatic Control, 36, 898-914.
40. Condon, A. (1989). Computational models of games. Cambridge, MA: The MIT Press.
41. Condon, A. (1992). The complexity of stochastic games. Information and Computation, 96, 203-224.
42. Cook, S.A. (1971). The complexity of theorem proving procedures. Proceedings of the third ACM symposium on the theory of computing (pp. 117-128).
43. Coxson, G. E., & De Marco, C. L. (1994). The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix. Mathematics of Control, Signals, and Systems, 7, 279-291.
44. Coxson, G. E. (1993). Computational complexity of robust stability and regularity in families of linear systems. Ph.D. thesis, Electrical and Computer Engineering Department, University of Wisconsin at Madison.
45. Dasgupta, S. (1988). Kharitonov's theorem revisited. Systems and Control Letters, 11, 381-384.
46. Daubechies, I., & Lagarias, J. C. (1992). Sets of matrices all infinite products of which converge. Linear Algebra Applications, 162, 227-263.
47. Davis, M. (1973). Hilbert's tenth problem is unsolvable. American Mathematical Monthly, 80, 233-269.
48. Davis, M. (1982). Computability and unsolvability. New York: Dover.
49. Demmel, J. W. (1992). The component-wise distance to the nearest singular matrix. SIAM Journal of Matrix Analysis and Applications, 13, 10-19.
50. Doyle, J. C. (1982). Analysis of feedback systems with structured uncertainties. IEE Proceedings, 129, 240-250.
51. Fu, M. (1999). Approximation of complex μ. In V. D. Blondel, E. D. Sontag, M. Vidyasagar, & J. C. Willems, Open problems in mathematical systems and control theory, Problem 22. London: Springer.
52. Fu, M., & Luo, Z.-Q. (1997). Computational complexity of a poblem aising in fixed order output feedback design. Systems and Control Letters, 30, 209-215.
53. Fu, M., & Barmish, B. R. (1988). Maximal unidirectional perturbation bounds for stability of polynomials and matrices. Systems and Control Letters, 11, 173-179.
54. psetting. Preprint.
55. Fu, M., Dasgupta, S., & Blondel, V. (1995). Robust stability under a class of nonlinear parametric perturbations. IEEE Transactions on Automatic Control, 40, 213-223.
56. Gantmacher, F.R. (1959). Matrix theory, vol. 2. New York: Chelsea Publishing Company.
57. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman and Co.
58. Garzon, M. (1995). Models of massive parallelism. Analysis of cellular automata and neural networks. Berlin: Springer.
59. Gittins, J. C. (1989). Multi-armed bandit allocation indices. New York: Wiley.
60. Golaszewski, C., & Ramadge, P. J. (1989). The complexity of some reachability problems for a system on a finite group. Systems and Control Letters, 12, 431-435.
61. Gripenberg, G. (1996). Computing the joint spectral radius. Linear Algebra Applications, 234, 43-60.
62. Gurvits, L. (1995). Stability of discrete linear inclusions. Linear Algebra Applications, 231, 47-85.
63. Gurvits, L. (1996). Stability of linear inclusions - Part 2. Technical Report TR 96-173, NEC Research.
64. Henzinger, T., Kopke, P., Puri, A., & Varaiya, P. (1998). What's decidable about hybrid automata. Journal of Computer and System Science, 57, 97-124.
65. Hertz, D. (1992). The extreme eigenvalues and stability of real symmetric interval matrices. IEEE Transactions on Automatic Control, 37, 532-535.
66. Hooper, P. (1966). The undecidability of the Turing machine immortality problem. The Journal of Symbolic Logic, 2, 219-234.
67. Hopcroft, J. E., & Ullman, J. D. (1969). Formal languages and their relation to automata. Reading, MA: Addison-Wesley.
68. Hopcroft, J. E., & Ullman, J. D. (1979). Introduction to automata theory, languages, and computation. Reading, MA: Addison-Wesley.
69. Hyotyniemu, H. (1997). On unsolvability of nonlinear system stability. Proceedings of the fourth European control conference, Brussels, vol. 636 (pp. 1-6).
70. Jones, J. P. (1974). Recursive undecidability. American Mathematical Monthly, 81, 724-738.
71. Karp, R. M. (1972). Reducibility among combinatorial problems. In R. Miller, & J. Thatcher, Complexity of computer computations. New York: Plenum Press (pp. 85-104).
72. Karp, R. M. (1978). A characterization of the minimum cycle mean in a digraph. Discrete Mathematics, 23, 309-311.
73. Kawski, M. (1990). The complexity of deciding controllability. Systems and Control Letters, 15, 9-14.
74. Khargonekar, P. P., & Tikku, A. (1996). Randomized algorithms for robust control analysis have polynomial complexity. Proceedings of the conference on decision and control.
75. Kharitonov, V. L. (1978). Asymptotic stability of an equilibrium position of a family of systems of linear differential equations. Differentsial'nye Uravneniya, 14, 2086-2088.
76. Kilian, J., & Siegelmann, H. (1996). The dynamic universality of sigmoidal neural networks. Information and Computation, 128, 48-56.
77. Klarner, D. A., Birget, J.-C., & Satterfield, W. (1991). On the undecidability of the freeness of integer matrix semigroups. International Journal of Algebra and Computation, 1, 223-226.
78. Koiran, P. (1996). A family of universal recurrent networks. Theoretical Computer Science, 168, 473-480.
79. Koiran, P., & Moore, C. (1999). Closed-form analytic maps in 1 or 2 dimension can simulate universal Turing machines. Theoretical Computer Science, 210, 217-223.
80. Koiran, P., Cosnard, M., & Garzon, M. (1994). Computability properties of low-dimensional dynamical systems. Theoretical Computer Science, 132, 113-128.
81. Kokame, H., & Mori, T. (1992). A branch-and-bound method to check the stability of a polytope of matrices. In M. Mansour, S. Balemi & W. Truoel, Robustness of dynamics systems with parameter uncertainties (pp. 125-137). Basel: Birkhauser.
82. Kozyakin, V. S. (1990). Algebraic unsolvability of problem of absolute stability of desynchronized systems. Automation and Remote Control, 51, 754-759.
83. Kreinovich, V., Lakeyev, A., & Rohn, J. (1995). Computational complexity of interval algebraic problems: Some are feasible and some are computationally intractable - a survey. Scientific computing and validated numerics (Wuppertal, 1995) (pp. 293-306). Mathematical Research, vol. 90. Berlin: Akademie Verlag.
84. Kreinovich, V., Lakeyev, A., Rohn, J., & Kahl, P. (1997). Computational complexity and feasibility of data processing and interval computation. Applied Optimization Series, vol. 10. Dordrecht: Kluwer Academic.
85. Krom, M. (1981). An unsolvable problem with products of matrices. Mathematical Systems Theory, 14, 335-337.
86. Krom, M., & Krom, M. (1989). Recursive solvability of problems with matrices. Z. Math. Logik Grundlagen Math., 35, 437-442.
87. Lafferierre, G., Pappas, G. J., & Yovine, S. (1999). A new class of decidable hybrid systems. Lecture Notes in Computer Sciences, vol. 1596. Heidelberg: Springer.
88. Lagarias, J. C., & Wang, Y. (1995). The finiteness conjecture for the generalized spectral radius of a set of matrices. Linear Algebra Applications, 214, 17-42.
89. Littman, M. L. (1994). Memoryless policies: Theoretical limitations and practical results.. In D. Cliff, P. Husbands, J.-A. Meyer, & S. W. Wilson, From animals to animals 3: Proceedings of the third International Conference on simulation of adaptive behavior. Cambridge, MA: The MIT Press.
90. Littman, M. L. (1996). Algorithms for sequential decision making. Ph.D. thesis, Department of Computer Science, Brown University.
91. Littman, M. L. (1997). Probabilistic propositional planning: Representations and complexity. In Proceedings of the 14th national conference on artificial intelligence (pp. 748-754). Cambridge, MA: AAAI Press/The MIT Press.
92. Littman, M. L., Dean, T. L., & Kaelbling, L. P. (1995). On the complexity of solving Markov decision problems. Proceedings of the 11th annual conference on uncertainty in artificial intelligence, Montreal, Québec, Canada (pp. 394-402).
93. Littman, M. L., Goldsmith, J., & Mundhenk, M. (1998). The computational complexity of probabilistic plan existence and evaluation. Journal of AI Research, 9, 1-36.
94. Liu, D., & Michel, A. (1994). Dynamical systems with saturation nonlinearities: Analysis and design. London: Springer.
95. Madani, O., Hanks, S., & Condon, A. (1999). On the undecidability of probabilistic planning and infinite-horizon partially observable Markov decision problems, Proceedings of AAAI99, to appear.
96. Matiyasevich, Yu. (1970). Enumerable sets are diophantine. Doklady Akademii Nauk SSSR, 191, 279-282.
97. Matiyasevich, Y., & Sénizergues, G. (1996). Decision problem for semi-Thue systems with a few rules. Proceedings of LICS96 (pp. 523-531). Silver Spring, MD: IEEE Computer Society Press.
98. Melekopoglou, M., & Condon, A. (1994). On the complexity of the policy improvement algorithm for markov decision processes. ORSA Journal on Computing, 6, 188-192.
99. Mignotte, M., Shorey, T. N., & Tijdeman, R. (1984). The distance between terms of an algebraic recurrence sequence. Journal fur die Reine and Angewandte Mathematik, 349, 63-76.
100. Minnichelli, R. J., Anagnost, J. J., & Desoer, C. A. (1989). An elementary proof of Kharitonov's theorem with extensions. IEEE Transactions on Automatic Control, 34, 995-998.
101. Minsky, M. (1967). Computation. Finite and infinite machines. Englewood Cliffs, NJ: Prentice-Hall.
102. Moore, C. (1990). Unpredictability and undecidability in dynamical systems. Physical Review Letters, 64, 2354-2357.
103. Moore, C. (1991). Generalized shifts: Undecidability and unpredictability in dynamical systems. Nonlinearity, 4, 199-230.
104. Moore, C. (1998). Finite-dimensional analog computers: Flows, maps, and recurrent neural networks. Proceedings of the first international conference on unconventional models of computation, Auckland, New Zealand.
105. Mundhenk, M. J., Goldsmith, J. Lusena, C., & Allender, E. (1997). Encyclopedia of complexity results for finite horizon Markov decision process problems. Technical Report 273-97, Computer Science Department, University of Kentucky.
106. Nemhauser, G. L., & Wolsey, L. A. (1988). Integer and combinatorial optimization. New York: Wiley.
107. Nemirovskii, A. (1993). Several NP-Hard problems arising in robust stability analysis. Mathematics of Control. Signals, and Systems, 63, 99-105.
108. Nemirovsky, A. S., & Yudin, D. B. (1983). Problem complexity and method efficiency in optimization. New York: Wiley.
109. Orponen, P. (1994). Computational complexity of neural networks: A survey. Nordic Journal of Computing, 1, 94-100.
110. Papadimitriou, C. H. (1994). Computational complexity. Reading, MA: Addison-Wesley.
111. Papadimitriou, C. H., & Tsitsiklis, J. N. (1982). On the complexity of designing distributed protocols. Information and Control, 53, 211-218.
112. Papadimitriou, C. H., & Tsitsiklis, J. N. (1986). Intractable problems in control theory. SIAM Journal of Control and Optimization, 24, 639-654.
113. Papadimitriou, C. H., & Tsitsiklis, J. N. (1987). The complexity of Markov decision processes. Mathematics of Operations Research, 12, 441-450.
114. Papadimitriou, C. H., & Tsitsiklis, J. N. (1994). The complexity of optimal queueing network control. Proceedings of the nineth annual conference on struture in complexity theory. Amsterdam, The Netherlands. Full version available from: http://web. mit.edu/jnt/www/publ.html.
115. Paterson, M. (1970). Unsolvability in 3 × 3 matrices. Studies in Applied Mathematics, 49, 105-107.
116. Poljak, S., & Rohn, J. (1993). Checking robust nonsingularity is NP-hard. Mathematics of Control, Signals, and Systems, 6, 1-9.
117. Pollack, J. B. (1987). On connectionist models of natural language processing. Ph.D. thesis, Department of Computer Science, University of Illinois, Urbana.
118. Post, E. L. (1946). A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society, 52, 264-268.
119. Puterman, M. L. (1994). Markov decision processes. New York: Wiley.
120. Puterman, M. L., & Brumelle, S. L. (1978). The analytic theory of policy iteration. In M.L. Puterman, Dynamic programming and its applications. New York: Academic Press.
121. Raghavan, T. E. S., & Filar, J. A. (1991). Algorithms for stochastic games - a survey. Zeitschrift für O. R., 35, 437-472.
122. Radner, R. (1962). Team decision problems. Annals of Mathematical Statistics, 33, 857-881.
123. Ramadge, P. J. (1983). Control and supervision of discrete event processes. Ph.D. thesis, Department of Electrical Engineering, University of Toronto.
124. Ramadge, P. J., & Wonham, W. M. (1987). Supervisory control of a class of discrete event processes. SIAM J. Control Optimization, 25, 206-230.
125. Rogozhin, Y. (1996). Small universal Turing machines. Theoretical Computer Science, 168, 215-240.
126. Rohn, J. (1994a). Positive definiteness and stability of interval matrices. SIAM Journal on Matrix Analysis and Applications, 15, 175-184.
127. Rohn, J. (1994b). Checking positive definiteness or stability of symmetric interval matrices is NP-hard. Commentationes Mathematicae Universitatis Carolinae, 35, 795-797.
128. Rohn, J. (1997). Complexity of some linear problems with interval data. Reliable Computing, 3, 315-323.
129. Rosenthal, J., & Wang, X. (1997). Inverse eigenvalue problems for multivariable linear systems. In C. I. Byrnes, B. N. Datta, D. Gilliam, & C. F. Martin, Systems and control in the twenty-first century (pp. 289-311). Basel: Birkhauser.
130. Rota, G.-C., & Strang, G. (1960). A note on the joint spectral radius. Nederlandse Koninklÿke Akademie & van Wetenschappen Indagationes Mathematicae, 22, 379-381.
131. Rudie, K., & Willems, J. C. (1995). The computational complexity of decentralized discrete-event control problems. IEEE Transactions on Automatic Control, 40, 1313-1319.
132. Ruohonen, K. (1997). Undecidable event detection problems for ODEs of dimension one and two. RAIRO Information and Theoretical Applications, 31, 67-79.
133. Rust, J. (1996). Numerical dynamic programming in economics. In H. Amman, D. Kendrick, & J. Rust, Handbook of computational economics (pp. 619-729). Amsterdam: Elsevier (Chapter 14).
134. Rust, J. (1997a). Using randomization to break the curse of dimensionality. Econometrica, 65(3), 487-516.
135. Rust, J. (1997b). A comparison of policy iteration methods for solving continuous-state, infinite-horizon Markovian decision problems using random, quasi-random, and deterministic discretizations. Available from the Economics Working Paper archive: http://econwpa.wustl.edu/eprints/comp/papers/9704/9704001.abs
136. Safonov, M. G. (1982). Stability margins of diagonally perturbed multi-variable feedback systems. Proceedings of IEE-D, 129, 251-256.
137. Salomaa, A. (1985). Computation and automata. Cambridge: Cambridge University Press.
138. Salomaa, A., & Soittola, M. (1978). Automata-theoretic aspects of formal power series. New York: Springer.
139. Samake, K. (1996). Suite récurrentes linéaires, problèmes d'effectivité. Ph.D. thesis, Institut de Recherche Mathématique Avançée, Université Louis Pasteur, Strasbourg, France.
140. Schrijver, A. (1986). Theory of linear and integer programming. New York: Wiley.
141. Seidenberg, A. (1954). A new decision method for elementary algebra. Annals of Mathematics, 60, 365-374.
142. Shapley, L. S. (1953). Stochastic games. Proceedings of the National Academy of Sciences, 39, 1095-1100.
143. Sideris, A. (1991). An efficient algorithm for checking the robust stability of a polytope of polynomials. Mathematics of Control, Signals, and Systems, 4, 315-337.
144. Siegelmann, H. T. (1998). Neural networks and analog computation. Beyond the Turing limit. Boston: Birkhauser.
145. Siegelmann, H. T., & Sontag, E. D. (1991). Turing computability with neural nets. Applied Mathematics Letters, 4, 77-80.
146. Siegelmann, H., & Sontag, E. (1994). Analog computation via neural networks. Theoretical Computer Science, 131, 331-360.
147. Siegelmann, H., & Sontag, E. (1995). On the computational power of neural nets. Journal of Computer and System Sciences, 132-150.
148. Soh, C. B. (1990). Necessary and sufficient conditions for stability of symmetric interval matrices. International Journal of Control, 51, 243-248.
149. Sontag, E. D. (1981). Nonlinear regulation: the piecewise linear approach. IEEE Transactions on Automatic Control, 26, 346-358.
150. Sontag, E. D. (1985). Real addition and the polynomial hierarchy. Information Processing Letters, 20, 115-120.
151. Sontag, E. D. (1988a). Controllability is harder to decide than accessibility. SIAM Journal of Control and Optimization, 26, 1106-1118.
152. Sontag, E. D. (1988b). Some complexity questions regarding controllability. Proceedings IEEE conference on decision and control, San Antonio, TX (pp. 1326-1329).
153. Sontag, E. D. (1995). From linear to nonlinear: Some complexity comparisons. Proceedings of the IEEE conference decision and control, New Orleans (pp. 2916-2920).
154. Sontag, E. D. (1996a). Interconnected automata and linear systems: A theoretical framework in discrete-time. In R. Alur, T. Henzinger, & E. D. Sontag, Hybrid systems III: Verification and control (pp. 436-448). Berlin: Springer.
155. Sontag, E. D. (1996b). Recurrent neural networks: Some learning and systems-theoretic aspects. Preprint.
156. Syrmos, V., Abdallah, C., & Dorato, P. (1994). Static output feedback: A survey. Automatica, 33, 125-137.
157. Tarski, A. (1951). A decision method for elementary algebra and geometry. Berkeley, USA: University of California Press.
158. Tempo, R., Bai, E. W., & Dabbene, F. (1996). Probabilistic robustness analysis: Explicit bounds for the minimum number of sampling points. Proceedings on IEEE conference decision and control (pp 2412-2420).
159. Toker, O. (1997). On the complexity of the robust stability problem for linear parameter varying systems. Automatica, 33, 2015-2017.
160. Toker, O. (1996). On the algorithmic unsolvability of some stability problems for discrete event systems. Proceedings of IFAC world congress (pp. 353-358).
161. Toker, O., & de Jager, P. (1999). Conservatism of the standard upper bound test. In V. D. Blondel, E. D. Sontag, M. Vidyasagar, & J. C. Willems, Open problems in mathematical systems and control theory, Problem 20. London: Springer.
162. Toker, O., & Ozbay, H. (1998). On the complexity of purely complex μ computation and related problems in multidimensional systems. IEEE Transactions on Automatic Control, 43, 409-414.
163. Toker, O., & Ozbay, H. (1996). Complexity issues in robust stability of linear delay-differential systems. Mathematics of Control, Signals, and Systems, 9, 386-400.
164. Toker, O., & Ozbay, H. (1995). On the NP-hardness of solving bilinear matrix inequalities and simultaneous stabilization with static output feedback. Proceedings of the IEEE American control conference, Seattle, WA (pp. 2525-2526).
165. Traub, J., Wasilkowski, G., & Woźniakowski, H. (1988). Information-based complexity. New York: Academic Press.
166. Trei, S. (1999). The gap between complex structured singular value and its upper bound is infinite. Preprint, http://www.math.msu.edu/ ∼treil/research.html.
167. Tseng, P. (1990). Solving h-horizon, stationary Markov decision problems in time proportional to log h. Operations Research Letters, 9, 287-297.
168. Tsitsiklis, J. N. (1984). Problems in decentralized decision making and computation. Ph.D. thesis, Department of Electrical Engineering and Computer Science. Cambridge, MA: MIT Press.
169. Tsitsiklis, J. N. (1989). On the control of discrete-event dynamical systems. Mathematics of Control, Signals, and Systems, 2, 95-107.
170. Tsitsiklis, J. N., & Athans, M. (1985). On the complexity of decentralized decision making and detection problems. IEEE Transactions on Automatic Control, 30, 440-446.
171. Tsitsiklis, J. N., & Blondel, V. D. (1997a). The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate. Mathematics of Control Signals, and Systems, 10, 31-40.
172. Tsitsiklis, J. N., & Blondel, V. D. (1997b). Lyapunov exponents of pairs of matrices, a correction. Mathematics of Control, Signals, and Systems, 10, 381.
173. Vidyasagar, M. (1998). A theory of learning and generalization. With applications to neural networks and control systems. London: Springer.
174. Vidyasagar, M., & Blondel, V. D. (1999). Probabilistic solutions to some NP-hard matrix problems. Preprint.
175. Whitt, W. (1978a). Approximations of dynamic programs - I. Mathematics of Operations Research, 3, 231-243.
176. Whitt, W. (1978b). Approximations of dynamic programs - II. Mathematics of Operations Research, 4, 179-185.
177. Whittle, P. (1988). Restless bandits: Activity allocation in a changing world. In J. Gani, A celebration of applied probability, Journal of Applied Probability, 25A, 287-298.
178. Witsenhausen, H. S. (1968). A counterexample in stochastic optimum control. SIAM Journal of Control and Optimization, 6, 138-147.
179. Zhou, K., Doyle, J. C., & Glover, K. (1995). Robust and optimal control. Englewood Cliffs, NJ: Prentice Hall.
180. Zwick, U., & Paterson, M. (1996). The complexity of mean payoff games on graphs. Theoretical Computer Science, 158, 343-359.