arXiv (OAI Expanded)
open access
Static output-feedback stabilization is NP-hard
We prove that unrestricted static output-feedback stabilization is NP-hard, already in the single-input multiple-output case. More precisely, we give a polynomial-time many-one reduction from the NP-complete Betweenness problem. Given an instance with $n$ elements and $m$ betweenness constraints, th
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
- On the NP-Hardness of Unconstrained Static Output Feedback Stabilization#1143329
- Complexity of Output Feedback Stabilization#1048812
- Geometric Control Theory Over Networks: Minimal Node Cardinality Disturbance Decoupling Problems#617877
- Geometric Control Theory Over Networks: Minimal Node Cardinality Disturbance Decoupling Problems#617377
- Output Feedback Stabilization of Reaction-Diffusion Equations in H2-norm#147637
Record · ID 1123303
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