A survey of computational complexity results in systems and control
暂无分享,去创建一个
[1] V. Blondel,et al. The presence of a zero in an integer linear recurrent sequence is NP-hard to decide , 2002 .
[2] A. U.S.,et al. Maximal unidirectional perturbation bounds for stability of polynomials and matrices * , 2002 .
[3] Mariëlle Stoelinga,et al. An Introduction to Probabilistic Automata , 2002, Bull. EATCS.
[4] Vincent D. Blondel,et al. Probabilistic solutions to some NP-hard matrix problems , 2001, Autom..
[5] John N. Tsitsiklis,et al. Deciding stability and mortality of piecewise affine dynamical systems , 2001, Theor. Comput. Sci..
[6] John N. Tsitsiklis,et al. Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard , 2000, IEEE Trans. Autom. Control..
[7] John N. Tsitsiklis,et al. The Stability of Saturated Linear Dynamical Systems Is Undecidable , 2000, J. Comput. Syst. Sci..
[8] S. Treil. THE GAP BETWEEN COMPLEX STRUCTURED SINGULAR VALUE μ AND ITS UPPER BOUND IS INFINITE , 2000 .
[9] Anne Condon,et al. On the Undecidability of Probabilistic Planning and Infinite-Horizon Partially Observable Markov Decision Problems , 1999, AAAI/IAAI.
[10] John N. Tsitsiklis,et al. The Complexity of Optimal Queuing Network Control , 1999, Math. Oper. Res..
[11] Gerardo Lafferriere,et al. A New Class of Decidable Hybrid Systems , 1999, HSCC.
[12] Hava T. Siegelmann,et al. Neural networks and analog computation - beyond the Turing limit , 1999, Progress in theoretical computer science.
[13] John N. Tsitsiklis,et al. Complexity of stability and controllability of elementary hybrid systems , 1999, Autom..
[14] Cristopher Moore,et al. Closed-for Analytic Maps in One and Two Dimensions can Simulate Universal Turing Machines , 1999, Theor. Comput. Sci..
[15] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[16] D. Vincent,et al. Boundedness of nitely generated matrixsemigroups is undecidable , 1999 .
[17] Arjan van der Schaft,et al. Open Problems in Mathematical Systems and Control Theory , 1999 .
[18] M. Branicky,et al. On matrix mortality in low dimensions , 1999 .
[19] M. Fu. Approximation of complex µ , 1999 .
[20] O. Toker,et al. Conservatism of the standard upper bound test: Is sup({{\bar \mu } \mathord{\left/{\vphantom {{\bar \mu } \mu }} \right.\kern-\nulldelimiterspace} \mu }) finite? Is it bounded by 2? , 1999 .
[21] Hava T. Siegelmann,et al. Neural Networks and Analog Computation , 1999, Progress in Theoretical Computer Science.
[22] J. Tsitsiklis,et al. Overview of complexity and decidability results for three classes of elementary nonlinear systems , 1999 .
[23] M. Littman,et al. The Computational Complexity of Probabilistic Planning , 1998, J. Artif. Intell. Res..
[24] O. Toker,et al. On the complexity of purely complex μ computation and related problems in multidimensional systems , 1998, IEEE Trans. Autom. Control..
[25] Lenore Blum,et al. Complexity and Real Computation , 1997, Springer New York.
[26] Ruth F. Curtain,et al. Open Problems in Mathematical Systems and Control Theory , 1998 .
[27] E. Yaz. Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.
[28] V. Kreinovich. Computational Complexity and Feasibility of Data Processing and Interval Computations , 1997 .
[29] John N. Tsitsiklis,et al. Lyapunov exponents of pairs of matrices, a correction , 1997, Math. Control. Signals Syst..
[30] John N. Tsitsiklis,et al. When is a Pair of Matrices Mortal? , 1997, Inf. Process. Lett..
[31] E. Allender,et al. Encyclopaedia of Complexity Results for Finite-Horizon Markov Decision Process Problems , 1997 .
[32] J. Rohn. Complexity of Some Linear Problems with Interval Data , 1997 .
[33] Michael L. Littman,et al. Probabilistic Propositional Planning: Representations and Complexity , 1997, AAAI/IAAI.
[34] S. Dasgupta,et al. Computational complexity of real structured singular value in ℓ p setting , 1997 .
[35] H. Hyötyniemi. On unsolvability of nonlinear system stability , 1997 .
[36] Z. Luo,et al. Computational complexity of a problem arising in fixed order output feedback design , 1997 .
[37] John Rust. A Comparison of Policy Iteration Methods for Solving Continuous-State, Infinite-Horizon Markovian Decision Problems Using Random, Quasi-Random, and Deterministic Discretizations , 1997 .
[38] 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..
[39] Mathukumalli Vidyasagar,et al. A Theory of Learning and Generalization , 1997 .
[40] Onur Toker,et al. On the complexity of the robust stability problem for linear parameter varying systems , 1996, Autom..
[41] J. Rosenthal,et al. Inverse eigenvalue problems for multivariable linear systems , 1997 .
[42] Mathukumalli Vidyasagar,et al. A Theory of Learning and Generalization: With Applications to Neural Networks and Control Systems , 1997 .
[43] Keijo Ruohonen. Undecidable Event Detection Problems for Odes of Dimension One and Two , 1997, RAIRO Theor. Informatics Appl..
[44] H. Hyotyniemi. On unsolvability of nonlinear system stability , 1997, 1997 European Control Conference (ECC).
[45] John N. Tsitsiklis,et al. Introduction to linear optimization , 1997, Athena scientific optimization and computation series.
[46] Pramod P. Khargonekar,et al. Randomized algorithms for robust control analysis and synthesis have polynomial complexity , 1996, Proceedings of 35th IEEE Conference on Decision and Control.
[47] Onur Toker,et al. Mathematics of Control , Signals , and Systems Complexity Issues in Robust Stability of Linear Delay-Differential Systems * , 2005 .
[48] Pascal Koiran. A Family of Universal Recurrent Networks , 1996, Theor. Comput. Sci..
[49] Yurii Rogozhin,et al. Small Universal Turing Machines , 1996, Theor. Comput. Sci..
[50] Olivier Bournez,et al. On the Computational Power of Dynamical Systems and Hybrid Systems , 1996, Theor. Comput. Sci..
[51] Michael S. Branicky,et al. Studies in hybrid systems: modeling, analysis, and control , 1996 .
[52] Yuri V. Matiyasevich,et al. Decision problems for semi-Thue systems with a few rules , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[53] Hava T. Siegelmann,et al. The Dynamic Universality of Sigmoidal Neural Networks , 1996, Inf. Comput..
[54] O. Toker. On the Algorithmic Unsolvability of Some Stability Problems for Discrete Event Systems , 1996 .
[55] Michel de Rougemont,et al. On the Complexity of Partially Observed Markov Decision Processes , 1996, Theor. Comput. Sci..
[56] G. Gripenberg. COMPUTING THE JOINT SPECTRAL RADIUS , 1996 .
[57] J. Doyle,et al. Robust and optimal control , 1995, Proceedings of 35th IEEE Conference on Decision and Control.
[58] John Rust. Numerical dynamic programming in economics , 1996 .
[59] Michael L. Littman,et al. Algorithms for Sequential Decision Making , 1996 .
[60] M. Paterson,et al. The complexity of mean payo games on graphs , 1996 .
[61] Eduardo D. Sontag,et al. Interconnected Automata and Linear Systems: A Theoretical Framework in Discrete-Time , 1996, Hybrid Systems.
[62] Uri Zwick,et al. The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..
[63] Eduardo Sontag. From linear to nonlinear: some complexity comparisons , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.
[64] J. Tsitsiklis,et al. NP-hardness of some linear control design problems , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.
[65] L. Gurvits. Stability of discrete linear inclusion , 1995 .
[66] Leslie Pack Kaelbling,et al. On the Complexity of Solving Markov Decision Problems , 1995, UAI.
[67] R. Tempo,et al. A global linear programming solution to some open robustness problems including matrix polytope stability , 1995, Proceedings of 1995 American Control Conference - ACC'95.
[68] O. Toker,et al. On the NP-hardness of solving bilinear matrix inequalities and simultaneous stabilization with static output feedback , 1995, Proceedings of 1995 American Control Conference - ACC'95.
[69] Max H. Garzon,et al. Models of massive parallelism: analysis of cellular automata and neural networks , 1995 .
[70] Pravin Varaiya,et al. What's decidable about hybrid automata? , 1995, STOC '95.
[71] Dimitri P. Bertsekas,et al. Dynamic Programming and Optimal Control, Two Volume Set , 1995 .
[72] Thomas A. Henzinger,et al. The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..
[73] Amir Pnueli,et al. Reachability Analysis of Dynamical Systems Having Piecewise-Constant Derivatives , 1995, Theor. Comput. Sci..
[74] Michael S. Branicky,et al. Universal Computation and Other Capabilities of Hybrid and Continuous Dynamical Systems , 1995, Theor. Comput. Sci..
[75] J. Lagarias,et al. The finiteness conjecture for the generalized spectral radius of a set of matrices , 1995 .
[76] Vincent D. Blondel,et al. Survey on the State of Systems and Control , 1995, Eur. J. Control.
[77] Max H. Garzon,et al. Models of Massive Parallelism , 1995, Texts in Theoretical Computer Science. An EATCS Series.
[78] John Rust. Using Randomization to Break the Curse of Dimensionality , 1997 .
[79] Marie-Françoise Roy,et al. On the combinatorial and algebraic complexity of quantifier elimination , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[80] Chaouki T. Abdallah,et al. Static output feedback: a survey , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.
[81] Christopher L. DeMarco,et al. The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix , 1994, Math. Control. Signals Syst..
[82] S. Basu,et al. On the Combinatorial and Algebraic Complexity of Quantifier Elimination , 1994, FOCS.
[83] Michel Cosnard,et al. Computability with Low-Dimensional Dynamical Systems , 1994, Theor. Comput. Sci..
[84] Tom Bylander,et al. The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..
[85] A. Michel,et al. Dynamical Systems with Saturation Nonlinearities: Analysis and Design , 1994 .
[86] Michael L. Littman,et al. Memoryless policies: theoretical limitations and practical results , 1994 .
[87] John N. Tsitsiklis,et al. The complexity of optimal queueing network control , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.
[88] M. Morari,et al. Computational complexity of /spl mu/ calculation , 1994 .
[89] Anne Condon,et al. On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes , 1994, INFORMS J. Comput..
[90] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[91] Pekka Orponen,et al. Computational complexity of neural networks: a survey , 1994 .
[92] D. Cliff. From animals to animats 3 : proceedings of the Third International Conference on Simulation of Adaptive Behavior , 1994 .
[93] J. Rohn. Positive Definiteness and Stability of Interval Matrices , 1994 .
[94] Stephen P. Boyd,et al. Linear Matrix Inequalities in Systems and Control Theory , 1994 .
[95] J. Rohn. Checking positive definiteness or stability of symmetric interval matrices is NP-hard , 1994 .
[96] Hava T. Siegelmann,et al. Analog computation via neural networks , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[97] Richard D. Braatz,et al. Computational complexity of μ calculation , 1993, 1993 American Control Conference.
[98] Svatopluk Poljak,et al. Checking robust nonsingularity is NP-hard , 1993, Math. Control. Signals Syst..
[99] Michel Cosnard,et al. Computability Properties of Low-dimensional Dynamical Systems , 1993, STACS.
[100] G. Coxson,et al. Computational complexity of robust stability and regularity in families of linear systems , 1993 .
[101] Arkadi Nemirovski,et al. Several NP-hard problems arising in robust stability analysis , 1993, Math. Control. Signals Syst..
[102] Jan C. WillemsInstitute. The Computational Complexity of Decentralized Discrete-Event Control Problems , 1993 .
[103] Hava T. Siegelmann,et al. On the computational power of neural nets , 1992, COLT '92.
[104] D. Hertz. The extreme eigenvalues and stability of real symmetric interval matrices , 1992 .
[105] Yang Wang,et al. Bounded semigroups of matrices , 1992 .
[106] Anne Condon,et al. The Complexity of Stochastic Games , 1992, Inf. Comput..
[107] I. Daubechies,et al. Sets of Matrices All Infinite Products of Which Converge , 1992 .
[108] James Demmel,et al. The Componentwise Distance to the Nearest Singular Matrix , 1992, SIAM J. Matrix Anal. Appl..
[109] H. Kokame,et al. A Branch and Bound Method to Check the Stability of a Polytope of Matrices , 1992 .
[110] Athanasios Sideris. An efficient algorithm for checking the robust stability of a polytope of polynomials , 1991, Math. Control. Signals Syst..
[111] J. Tsitsiklis,et al. An optimal one-way multigrid algorithm for discrete-time stochastic control , 1991 .
[112] Jean-Camille Birget,et al. On the Undecidability of the Freeness of Integer Matrix Semigroups , 1991, Int. J. Algebra Comput..
[113] C. Moore,et al. Generalized shifts: unpredictability and undecidability in dynamical systems Nonlinearity 4 199-230 , 1991 .
[114] Anne Condon. The Complexity of the Max Word Problem , 1991, STACS.
[115] T. E. S. Raghavan,et al. Algorithms for stochastic games — A survey , 1991, ZOR Methods Model. Oper. Res..
[116] D. W. Lewis. Matrix theory , 1991 .
[117] J. Hershey. Computation , 1991, Digit. Signal Process..
[118] Eduardo Sontag,et al. Turing computability with neural nets , 1991 .
[119] P. Tseng. Solving H-horizon, stationary Markov decision problems in time proportional to log(H) , 1990 .
[120] M. Kawski. The complexity of deciding controllability , 1990 .
[121] S. Dasgupta,et al. Robust Stability under a Class of Nonlinear Parametric Perturbations , 1990, 1990 American Control Conference.
[122] Moore,et al. Unpredictability and undecidability in dynamical systems. , 1990, Physical review letters.
[123] J. Bather,et al. Multi‐Armed Bandit Allocation Indices , 1990 .
[124] C. Soh. Necessary and sufficient conditions for stability of symmetric interval matrices , 1990 .
[125] John N. Tsitsiklis,et al. The complexity of dynamic programming , 1989, J. Complex..
[126] Richard J. Lipton,et al. On the complexity of space bounded interactive proofs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[127] C. Desoer,et al. An elementary proof of Kharitonov's stability theorem with extensions , 1989 .
[128] Anne Condon,et al. Computational models of games , 1989, ACM distinguished dissertations.
[129] P. Ramadge,et al. The complexity of some reachability problems for a system on a finite group , 1989 .
[130] Christian M. Ernst,et al. Multi-armed Bandit Allocation Indices , 1989 .
[131] Melven Krom,et al. Recursive Solvability of Problems with Matrices , 1989, Math. Log. Q..
[132] Eduardo Sontag. Some complexity questions regarding controllability , 1988, Proceedings of the 27th IEEE Conference on Decision and Control.
[133] Jean Berstel,et al. Rational series and their languages , 1988, EATCS monographs on theoretical computer science.
[134] S. Dasgupta. Kharitonov's theorem revisited , 1988 .
[135] Eduardo Sontag. Controllability is harder to decide than accessibility , 1988 .
[136] H. Woxniakowski. Information-Based Complexity , 1988 .
[137] P. Whittle. Restless bandits: activity allocation in a changing world , 1988, Journal of Applied Probability.
[138] John N. Tsitsiklis,et al. On the control of discrete-event dynamical systems , 1987, 26th IEEE Conference on Decision and Control.
[139] John N. Tsitsiklis,et al. The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..
[140] Henryk Wozniakowski,et al. Information-based complexity , 1987, Nature.
[141] Huang Lin,et al. Root locations of an entire polytope of polynomials: It suffices to check the edges , 1987, 1987 American Control Conference.
[142] P. Ramadge,et al. Supervisory control of a class of discrete event processes , 1987 .
[143] Christos Papadimitriou,et al. Intractable problems in control theory , 1985, 1985 24th IEEE Conference on Decision and Control.
[144] Eduardo D. Sontag,et al. Real Addition and the Polynomial Hierarchy , 1985, Inf. Process. Lett..
[145] John N. Tsitsiklis,et al. Problems in decentralized decision making and computation , 1984 .
[146] Arto Salomaa,et al. Computation and Automata , 1984 .
[147] T. Shorey,et al. The distance between terms of an algebraic recurrence sequence. , 1984 .
[148] Jerzy Seidler,et al. Problem Complexity and Method Efficiency in Optimization , 1984 .
[149] Peter Jeffrey Godwin Ramadge,et al. Control and supervision of discrete event processes , 1983 .
[150] John Darzentas,et al. Problem Complexity and Method Efficiency in Optimization , 1983 .
[151] J. Doyle. Analysis of Feedback Systems with Structured Uncertainty , 1982 .
[152] John N. Tsitsiklis,et al. On the Complexity of Designing Distributed Protocols , 1982, Inf. Control..
[153] M. Safonov. Stability margins of diagonally perturbed multivariable feedback systems , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.
[154] Eduardo Sontag. Nonlinear regulation: The piecewise linear approach , 1981 .
[155] Robert K. Brayton,et al. Constructive stability and asymptotic stability of dynamical systems , 1980 .
[156] 守屋 悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .
[157] Martin L. Puterman,et al. Dynamic Programming and Its Application , 1979 .
[158] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .
[159] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[160] Ward Whitt,et al. Approximations of Dynamic Programs, II , 1979, Math. Oper. Res..
[161] Ward Whitt,et al. Approximations of Dynamic Programs, I , 1978, Math. Oper. Res..
[162] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[163] Martin L. Puterman,et al. THE ANALYTIC THEORY OF POLICY ITERATION , 1978 .
[164] Richard M. Karp,et al. A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..
[165] Arto Salomaa,et al. Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.
[166] B. Anderson,et al. Output feedback stabilization and related problems-solution via decision methods , 1975 .
[167] James P. Jones. Recursive Undecidability — An Exposition , 1974 .
[168] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[169] Martin D. Davis. Hilbert's Tenth Problem is Unsolvable , 1973 .
[170] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .
[171] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .
[172] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[173] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[174] M. Paterson. Unsolvability in 3 × 3 Matrices , 1970 .
[175] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.
[176] H. Witsenhausen. A Counterexample in Stochastic Optimum Control , 1968 .
[177] Marvin Minsky,et al. Computation : finite and infinite machines , 2016 .
[178] Philip K. Hooper. The undecidability of the Turing machine immortality problem , 1966, Journal of Symbolic Logic.
[179] R. Radner,et al. Team Decision Problems , 1962 .
[180] Martin D. Davis,et al. Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.
[181] A. Seidenberg. A NEW DECISION METHOD FOR ELEMENTARY ALGEBRA , 1954 .
[182] L. Shapley,et al. Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.
[183] A. Tarski. A Decision Method for Elementary Algebra and Geometry , 2023 .
[184] Emil L. Post. A variant of a recursively unsolvable problem , 1946 .
[185] F. Aveling. The University of Louvain , 1914 .
[186] ASYMPTOTIC STABILITY OF AN EQUILIBRIUM P . OSITION OF A FAMILY OF SYSTEMS OF LINEAR DIFFERENTIAL EQUATIONS , 2022 .
[187] K. Khalil. On the Complexity of Decentralized Decision Making and Detection Problems , 2022 .