Overview of complexity and decidability results for three classes of elementary nonlinear systems

DOI10.1007/BFb0109720zbMath0925.93217OpenAlexW1523169754MaRDI QIDQ4227145

Blondel, Vincent D., John N. Tsitsiklis

Publication date: 8 November 1999

Published in: Learning, control and hybrid systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0109720

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonlinear systems in control theory (93C10)

Related Items (3)

On the decidability of reachability in continuous time linear time-invariant systems ⋮ A survey of computational complexity results in systems and control ⋮ The stability of saturated linear dynamical systems is undecidable

This page was built for publication: Overview of complexity and decidability results for three classes of elementary nonlinear systems