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

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

Abstract

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 Apr 2019 06:15
URI: https://eprints.mdx.ac.uk/id/eprint/16749

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year