Continuous-time orbit problems are decidable in polynomial-time

被引：5
|
作者：
Chen, Taolue [1 ]
Yu, Nengkun [3 ,4 ]
Han, Tingting [2 ]
机构：
[1] Middlesex Univ, Dept Comp Sci, London N17 8HR, England
[2] Univ London, Dept Comp Sci & Informat Syst, London WC1E 7HU, England
[3] Univ Waterloo, Inst Quantum Comp, Waterloo, ON N2L 3G1, Canada
[4] Univ Guelph, Dept Math & Stat, Guelph, ON N1G 2W1, Canada
来源：
INFORMATION PROCESSING LETTERS | 2015年 / 115卷 / 01期
关键词：
Dynamical systems; Differential equation; Computational complexity; Continuous-time orbit problem; Linear algebra;
D O I：
10.1016/j.ipl.2014.08.004
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We place the continuous-time orbit problem in P, sharpening the decidability result shown by Hainry [7]. (c) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：11 / 14
页数：4
相关论文
共 50 条
12345