On the public citation graph
The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix
0 signed · 40 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01211741openalex-snapshot
Several NP-hard problems arising in robust stability analysis
inferredcites →https://doi.org/10.1007/bf01213466openalex-snapshot
Checking robust nonsingularity is NP-hard
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1017/cbo9780511526473openalex-snapshot
Interval Methods for Systems of Equations
inferredcites →https://doi.org/10.1049/ip-d.1982.0053openalex-snapshot
Analysis of feedback systems with structured uncertainties
inferredcites →https://doi.org/10.1109/9.284879openalex-snapshot
Computational complexity of μ calculation
inferredcites →https://doi.org/10.1109/cdc.1981.269503openalex-snapshot
Stability margins of diagonally perturbed multivariable feedback systems
inferredcites →https://doi.org/10.1109/cdc.1988.194370openalex-snapshot
Robust stability of linear systems relative to guarded domains
inferredcites →https://doi.org/10.1109/sfcs.1992.267823openalex-snapshot
Proof verification and hardness of approximation problems
inferredcites →https://doi.org/10.1137/0613003openalex-snapshot
The Componentwise Distance to the Nearest Singular Matrix
inferredcites →https://doi.org/10.1145/195058.195216openalex-snapshot
.879-approximation algorithms for MAX CUT and MAX 2SAT
inferredcites →https://doi.org/10.1145/62212.62233openalex-snapshot
Optimization, approximation, and complexity classes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rnc.666openalex-snapshot
A comparison of small gain versus Lyapunov type robust stability bounds
inferred← citeshttps://doi.org/10.1007/978-1-4471-0807-8_22openalex-snapshot
Approximation of complex µ
inferred← citeshttps://doi.org/10.1007/978-1-4471-0807-8_43openalex-snapshot
Conservatism of the standard upper bound test: Is sup( $${{\bar \mu } \mathord{\left/ {\vphantom {{\bar \mu } \mu }} \right. \kern-\nulldelimiterspace} \mu }$$ ) finite? Is it bounded by 2?
inferred← citeshttps://doi.org/10.1007/978-1-4471-4610-0_5openalex-snapshot
Limits of the Robustness Paradigm
inferred← citeshttps://doi.org/10.1007/978-3-0348-8970-4_12openalex-snapshot
Probabilistic Robustness Analysis and Design of Uncertain Systems
inferred← citeshttps://doi.org/10.1007/bf01211858openalex-snapshot
Complexity issues in robust stability of linear delay-differential systems
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2013.09.018openalex-snapshot
Computational complexity and related topics of robustness margin calculation using μ theory: A review of theoretical developments
inferred← citeshttps://doi.org/10.1016/s0005-1098(00)00050-9openalex-snapshot
A survey of computational complexity results in systems and control
inferred← citeshttps://doi.org/10.1016/s0005-1098(01)00122-4openalex-snapshot
Randomized algorithms for robust controller synthesis using statistical learning theory
inferred← citeshttps://doi.org/10.1016/s0167-6911(97)00131-xopenalex-snapshot
On computational complexity of invalidating structured uncertainty models
inferred← citeshttps://doi.org/10.1023/a:1009739827008openalex-snapshot
Approximation Algorithms for Quadratic Programming
inferred← citeshttps://doi.org/10.1023/a:1009901405160openalex-snapshot
Computing Exact Bounds on Elements of an Inverse Interval Matrix is NP-Hard
inferred← citeshttps://doi.org/10.1109/37.736014openalex-snapshot
Statistical learning theory and randomized algorithms for control
inferred← citeshttps://doi.org/10.1109/9.623094openalex-snapshot
The real structured singular value is hardly approximable
inferred← citeshttps://doi.org/10.1109/9.887670openalex-snapshot
Computational complexity of real structured singular value in l/sub p/ setting
inferred← citeshttps://doi.org/10.1109/9.895560openalex-snapshot
Randomized algorithms for probabilistic robustness with real and complex structured uncertainty
inferred← citeshttps://doi.org/10.1109/cdc.1995.478584openalex-snapshot
NP-hardness of some linear control design problems
inferred← citeshttps://doi.org/10.1109/cdc.1996.572677openalex-snapshot
On the conservatism of upper bound tests for structured singular value analysis
inferred← citeshttps://doi.org/10.1109/cdc.1996.574309openalex-snapshot
Time domain validation of structured uncertainty model sets
inferred← citeshttps://doi.org/10.1109/cdc.2013.6760900openalex-snapshot
Computational complexity of robust control: A review of theoretical and algorithmic developments
inferred← citeshttps://doi.org/10.1137/s0363012994272630openalex-snapshot
NP-Hardness of Some Linear Control Design Problems
inferred← citeshttps://doi.org/10.1137/s0895479803430953openalex-snapshot
Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
inferred← citeshttps://doi.org/10.23919/ecc.1997.7082647openalex-snapshot
Computational complexity of real structured singular value in ℓp setting
inferred← citeshttps://doi.org/10.2514/6.2023-1805openalex-snapshot
Structured Input-Output Tools for Modal Analysis of a Transitional Channel Flow
inferred← citeshttps://doi.org/10.2514/6.2023-1984openalex-snapshot
Structured Input-Output Analysis of Compressible Plane Couette Flow
inferred← citeshttps://doi.org/10.2514/6.2025-2201openalex-snapshot
Characterizing Quasi-Secondary Instabilities in Compressible Flows Using the Structured Input-Output Framework
inferred← citeshttps://doi.org/10.3166/ejc.7.287-310openalex-snapshot
Randomized Algorithms for Robust Controller Synthesis Using Statistical Learning Theory: A Tutorial Overview
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.