Search CORE

3 research outputs found

Continuous-time orbit problems are decidable in polynomial-time

Author: Chen T.
Chen T.
Han T.
Han T.
Yu N.
Yu N.
Publication venue: Elsevier
Publication date: 01/01/2015
Field of study

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

Middlesex University Research Repository

Continuous-time orbit problems are decidable in polynomial-time

Author: Arvind
Baker
Bell
Cai
Chonev
Cohen
Hainry
Kannan
Nengkun Yu
Ouaknine
Taolue Chen
Tingting Han
Publication venue: 'Elsevier BV'
Publication date: 01/01/2015
Field of study

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

OPUS - University of Technology Sydney

Middlesex University Research Repository

Birkbeck Institutional Research Online

core

core