NP-hardness of the stable matrix in unit interval family problem in discrete time

DOI10.1016/S0167-6911(00)00095-5zbMath0974.93045OpenAlexW2068502868WikidataQ126989104 ScholiaQ126989104MaRDI QIDQ5940880

Alberto Mercado, K. J. Ray Liu

Publication date: 20 August 2001

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6911(00)00095-5

zbMATH Keywords

complexityrobust stabilityNP-hardness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete-time control/observation systems (93C55) Robust stability (93D09)

Cites Work

• Several NP-hard problems arising in robust stability analysis
• Limited communication control
• NP-Hardness of Some Linear Control Design Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: NP-hardness of the stable matrix in unit interval family problem in discrete time