Continuous-time orbit problems are decidable in polynomial-time

Chen, Taolue, Yu, Nengkun and Han, Tingting (2015) Continuous-time orbit problems are decidable in polynomial-time. Information Processing Letters, 115 (1) . pp. 11-14. ISSN 0020-0190 [Article] (doi:10.1016/j.ipl.2014.08.004)

PDF - Published version (with publisher's formatting)
Download (210kB) | Preview


We place the continuous-time orbit problem in P , sharpening the decidability result shown by Hainry [7]

Item Type: Article
Additional Information: Available online 22 August 2014
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 16749
Depositing User: Taolue Chen
Date Deposited: 03 Jun 2015 10:18
Last Modified: 04 Feb 2021 02:02

Actions (login required)

View Item View Item