Continuous-time orbit problems are decidable in polynomial-time

Taolue Chen; Nengkun Yu; Tingting Han

doi:10.1016/j.ipl.2014.08.004

Continuous-time orbit problems are decidable in polynomial-time

Taolue Chen
, Nengkun Yu
, Tingting Han

Computer Science

Middlesex University
Birkbeck University of London

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Abstract

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

Original language	English
Pages (from-to)	11-14
Number of pages	4
Journal	Information Processing Letters
Volume	115
Issue number	1
DOIs	https://doi.org/10.1016/j.ipl.2014.08.004
State	Published - Jan 2015

Keywords

Computational complexity
Continuous-time orbit problem
Differential equation
Dynamical systems
Linear algebra

Access to Document

10.1016/j.ipl.2014.08.004

Cite this

@article{227706b40bb2476fa180d47ce8da7279,

title = "Continuous-time orbit problems are decidable in polynomial-time",

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

keywords = "Computational complexity, Continuous-time orbit problem, Differential equation, Dynamical systems, Linear algebra",

author = "Taolue Chen and Nengkun Yu and Tingting Han",

year = "2015",

month = jan,

doi = "10.1016/j.ipl.2014.08.004",

language = "English",

volume = "115",

pages = "11--14",

journal = "Information Processing Letters",

issn = "0020-0190",

number = "1",

}

TY - JOUR

T1 - Continuous-time orbit problems are decidable in polynomial-time

AU - Chen, Taolue

AU - Yu, Nengkun

AU - Han, Tingting

PY - 2015/1

Y1 - 2015/1

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

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

KW - Computational complexity

KW - Continuous-time orbit problem

KW - Differential equation

KW - Dynamical systems

KW - Linear algebra

UR - https://www.scopus.com/pages/publications/84906833301

U2 - 10.1016/j.ipl.2014.08.004

DO - 10.1016/j.ipl.2014.08.004

M3 - Article

AN - SCOPUS:84906833301

SN - 0020-0190

VL - 115

SP - 11

EP - 14

JO - Information Processing Letters

JF - Information Processing Letters

IS - 1

ER -

Continuous-time orbit problems are decidable in polynomial-time

Abstract

Keywords

Access to Document

Other files and links

Cite this