The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Computational complexity of μ calculation
Abstract
The structured singular value /spl mu/ measures the robustness of uncertain systems. Numerous researchers over the last decade have worked on developing efficient methods for computing /spl mu/. This paper considers the complexity of calculating /spl mu/ with general mixed real/complex uncertainty in the framework of combinatorial complexity theory. In particular, it is proved that the /spl mu/ recognition problem with either pure real or mixed real/complex uncertainty is NP-hard. This strongly suggests that it is futile to pursue exact methods for calculating /spl mu/ of general systems with pure real or mixed uncertainty for other than small problems.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Analysis of feedback systems with structured uncertainties
Doyle, J. (1982) · IEE Proceedings D Control Theory and Applications · doi:10.1049/ip-d.1982.0053 · Cited by 2,059
Self-citationSome NP-complete problems in quadratic and nonlinear programming
Murty, K. G., & Kabadi, S. N. (1987) · Mathematical Programming · doi:10.1007/bf02592948 · Cited by 1,003
Quadratic programming is in NP
Vavasis, S. A. (1990) · Information Processing Letters · doi:10.1016/0020-0190(90)90100-c · Cited by 140
The Componentwise Distance to the Nearest Singular Matrix
Demmel, J. W. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613003 · Cited by 93
Cited by
Stability of Time-Delay Systems
Gu, K., Kharitonov, V. L., & Chen, J. (2003) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-0039-0 · Cited by 5,575
The Scenario Approach to Robust Control Design
Calafiore, G. C., & Campi, M. C. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.875041 · Cited by 1,150
A survey of computational complexity results in systems and control
Blondel, V. D., & Tsitsiklis, J. N. (2000) · Automatica · doi:10.1016/s0005-1098(00)00050-9 · Cited by 732
On the Sample Complexity of the Linear Quadratic Regulator
Dean, S., Mania, H., Matni, N., Recht, B., & Tu, S. (2020) · Foundations of Computational Mathematics · doi:10.1007/s10208-019-09426-y · Cited by 436
The scenario approach for systems and control design
Campi, M. C., Garatti, S., & Prandini, M. (2009) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2009.07.001 · Cited by 367
Metadata
- Authors
- Braatz, R. P., Young, P. M., Doyle, J. C., & Morari, M.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1994-05
- Volume
- 39
- Issue
- 5
- Pages
- 1000-1002
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W1563898868
- Cited by
- 329
- References
- 6
- FWCI
- 27.89
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computational complexity of μ calculation. https://app.cochat.ai/papers/10.1109/9.284879
- The paper
- Braatz, R. P., Young, P. M., Doyle, J. C., & Morari, M. (1994). Computational complexity of μ calculation. IEEE Transactions on Automatic Control. https://doi.org/10.1109/9.284879
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.