Remarks on ‘equivalence of stability concepts for discrete time-varying systems’

DOI10.1002/(SICI)1099-1239(199801)8:1%3C91::AID-RNC271%3E3.0.CO;2-JMaRDI QIDQ4385243zbMATH OpenOpenAlexFDO

Authors Fabian Wirth

Publication date 1 July 1998

Full work available at URL https://doi.org/10.1002/(sici)1099-1239(199801)8:1%3C91::aid-rnc271%3E3.0.co;2-j

zbMATH Keywords

computational complexityasymptotic stabilityNP-harddiscrete time-varying systemsdifference inclusions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete-time control/observation systems (93C55) Model systems in control theory (93C99) Asymptotic stability in control theory (93D20)

Recommendations

• Separating multi-oddity constrained shortest circuits over the polytope of stable multisets.
• Efficient algorithms on sets of permutations, dominance, and real-weighted APSP
• Inclusion relationships among permutation problems
• Publication:3479821
• Repeated columns and an old chestnut
• Permutations of bounded degree generate groups of polynomial diameter
• Permuting matrices to avoid forbidden submatrices
• scientific article; zbMATH DE number 3904502
• On the complexity of calculating sensitivity parameters in Boolean programming problems
• On the Complexity of Partial Order Productions

This page was built for publication: Remarks on ‘equivalence of stability concepts for discrete time-varying systems’

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385243)