Continuous-time orbit problems are decidable in polynomial-time

DOI10.1016/j.ipl.2014.08.004zbMath1371.68108OpenAlexW1972422534MaRDI QIDQ458374

Tingting Han, Taolue Chen, Nengkun Yu

Publication date: 7 October 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://eprints.mdx.ac.uk/16749/1/ipl15.pdf

zbMATH Keywords

computational complexitydynamical systemsdifferential equationlinear algebracontinuous-time orbit problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Stability theory for smooth dynamical systems (37C75)

Related Items (1)

On the decidability of reachability in continuous time linear time-invariant systems

Cites Work

• The continuous Skolem-Pisot problem
• Polynomial-time algorithm for the orbit problem
• Reachability in Linear Dynamical Systems
• The Orbit Problem Is in the GapL Hierarchy
• COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
• Positivity Problems for Low-Order Linear Recurrence Sequences
• The orbit problem in higher dimensions
• Unnamed Item
• Unnamed Item

This page was built for publication: Continuous-time orbit problems are decidable in polynomial-time