arXiv (All)
open access
On the NP-Hardness of Unconstrained Static Output Feedback Stabilization
In this paper we give a polynomial-time reduction from the Subset Sum Problem to unconstrained static output feedback stabilization, establishing its NP-hardness. The construction uses two scalar building blocks to impose approximate discrete choices and a weighted-sum constraint. Once the problem i
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
- P is not equal to NP#1076676
- Feedback Linearisation with State Constraints#173358
Record · ID 1143329
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