Some complexity problems on single input double output controllers

DOI10.1016/J.DAM.2008.03.028MaRDI QIDQ1028446zbMATH OpenOpenAlexFDO

Authors A. Yeo, Katalin Hangos, Zsolt Tuza

Publication date 30 June 2009

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2008.03.028

zbMATH Keywords

\(P_{3}\)-factordirected graphHall conditionpolynomial algorithmstate feedback controllerstructural process control

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Controllability, observability, and system structure (93B99)

Recommendations

• NP-Hardness of Some Linear Control Design Problems
• scientific article; zbMATH DE number 1182741
• The computational complexity of decentralized discrete-event control problems
• The complexity of deciding controllability
• Intractable Problems in Control Theory

Cites work

• Fast projection methods for minimal design problems in linear system theory
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Matching theory

Cited in

(2)

• Input-output decomposition of dynamic systems is NP-complete
• Satisfactory graph partition, variants, and generalizations

This page was built for publication: Some complexity problems on single input double output controllers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028446)