Computational Complexity of
暂无分享,去创建一个
Richard D. Braatz | Manfred Morari | John C. Doyle | Peter M. Young | M. Morari | J. Doyle | R. Braatz | P. M. Young | CalculationRichard D. Braatz | Peter M. Youngz | John C. Doylez | Manfred MorarixyKeywords
[1] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[2] John C. Doyle. Analysis of Feedback Systems with Structured Uncertainty , 1982 .
[3] Katta G. Murty,et al. Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..
[4] Stephen A. Vavasis,et al. Quadratic Programming is in NP , 1990, Inf. Process. Lett..
[5] Rama K. Yedavalli,et al. Recent Advances in Robust Control , 1990 .
[6] J. Doyle,et al. mu analysis with real parametric uncertainty , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.
[7] C. Nett,et al. On μ and stability of uncertain polynomials , 1992, 1992 American Control Conference.
[8] James Demmel,et al. The Componentwise Distance to the Nearest Singular Matrix , 1992, SIAM J. Matrix Anal. Appl..
[9] Svatopluk Poljak,et al. Checking robust nonsingularity is NP-hard , 1993, Math. Control. Signals Syst..
[10] A. Packard,et al. Continuity properties of the real/complex structured singular value , 1993, IEEE Trans. Autom. Control..