|
|||||
|
|
Continuous-time orbit problems are decidable in polynomial-time |
|
| Authors: | Taolue Chen Nengkun Yu Tingting Han |
| Affiliation: | 1. Department of Computer Science, Middlesex University London, United Kingdom;2. Department of Computer Science and Information Systems, Birkbeck, University of London, United Kingdom;3. Institute for Quantum Computing, University of Waterloo, Canada;4. Department of Mathematics & Statistics, University of Guelph, Canada |
| Abstract: | We place the continuous-time orbit problem in P, sharpening the decidability result shown by Hainry [7]. |
| Keywords: | Dynamical systems Differential equation Computational complexity Continuous-time orbit problem Linear algebra |
| 本文献已被 ScienceDirect 等数据库收录！ | |