arXiv (All)
open access
Complexity of Output Feedback Stabilization
We show that unless P = NP, there cannot be a polynomial-time (or even pseudo-polynomial-time) algorithm for output feedback stabilization of a linear dynamical system with a linear controller. This settles one of the best-known open problems in control theory. The result holds in both continuous an
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Static output-feedback stabilization is NP-hard#1123303
- Geometric Control Theory Over Networks: Minimal Node Cardinality Disturbance Decoupling Problems#617877
- Geometric Control Theory Over Networks: Minimal Node Cardinality Disturbance Decoupling Problems#617377
- Regularization and complexity control in feed-forward networks#230055
- Book review of: H. Johns and P. Omerod, Happiness, Economics, and Public Policy#742536
Record · ID 1048812
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive