Continuous-time orbit problems are decidable in polynomial-time

Article

Chen, T., Yu, N. and Han, T. 2015. Continuous-time orbit problems are decidable in polynomial-time. Information Processing Letters. 115 (1), pp. 11-14. https://doi.org/10.1016/j.ipl.2014.08.004
TypeArticle
TitleContinuous-time orbit problems are decidable in polynomial-time
AuthorsChen, T., Yu, N. and Han, T.
Abstract

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

PublisherElsevier
JournalInformation Processing Letters
ISSN0020-0190
Publication dates
PrintJan 2015
Publication process dates
Deposited03 Jun 2015
Accepted10 Aug 2014
Output statusPublished
Publisher's version
Additional information

Available online 22 August 2014

Digital Object Identifier (DOI)https://doi.org/10.1016/j.ipl.2014.08.004
LanguageEnglish
Permalink -

https://repository.mdx.ac.uk/item/8588x

Log in to edit

Download files

Publisher's version
ipl15.pdf

  • 13
    total views
  • 7
    total downloads
  • 1
    views this month
  • 1
    downloads this month

Export as