arXiv (All)
open access
The Complexity of Minimal Positive Realization
We study the complexity of minimal positive realization for discrete-time systems. We prove that, given a strictly proper transfer matrix with rational coefficients and an order bound encoded in unary, deciding whether a positive realization exists within that bound is complete for the existential t
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
- Vanishing Ideals and the Computational Tractability of Sum-of-Squares over Boolean Domains#1142234
- A Note on Binary Quadratic Systems and their relation to complexity theory#667919
- Approximate cloning of structured pure states#1215810
- A simpler proof of the Matrix Spencer Theorem#1110487
- Non-norm criteria and optimal $2\times 2$ space-time block codes over rings of integers of imaginary quadratic fields#189148
Record · ID 1411937
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