Chen, Taolue and Yu, N. and Han, Tingting (2015) Continuous-time orbit problems are decidable in polynomial-time. Information Processing Letters 115 (1), pp. 11-14. ISSN 0020-0190.
![[img]](https://eprints.bbk.ac.uk/style/images/fileicons/text.png) |
Text
1-s2.0-S0020019014001628-main.pdf - Published Version of Record Restricted to Repository staff only Download (210kB) | Request a copy |
Official URL: http://dx.doi.org/10.1016/j.ipl.2014.08.004
Abstract
We place the continuous-time orbit problem in P, sharpening the decidability result shown by Hainry [7].
Metadata
| Item Type: | Article |
|---|---|
| Keyword(s) / Subject(s): | Dynamical systems, Differential equation, Computational complexity, Continuous-time orbit problem, Linear algebra |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Research Centres and Institutes: | Data Analytics, Birkbeck Institute for |
| Depositing User: | Dr Tingting Han |
| Date Deposited: | 02 Dec 2015 13:19 |
| Last Modified: | 05 Apr 2025 09:01 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/13344 |
Statistics
Downloads
Activity Overview
6 month trend
6 month trend
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
Edit/View Item
